./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:23:13,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:23:13,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:23:13,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:23:13,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:23:13,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:23:13,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:23:13,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:23:13,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:23:13,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:23:13,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:23:13,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:23:13,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:23:13,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:23:13,922 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:23:13,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:23:13,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:23:13,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:23:13,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:23:13,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:23:13,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:23:13,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:23:13,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:23:13,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:23:13,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:23:13,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:23:13,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:23:13,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:23:13,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:23:13,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:23:13,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:23:13,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:23:13,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:23:13,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:23:13,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:23:13,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:23:13,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:23:13,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:23:13,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:23:13,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:23:13,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:23:13,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:23:13,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-10-24 06:23:14,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:23:14,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:23:14,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:23:14,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:23:14,239 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:23:14,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:15,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:23:16,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:23:16,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:16,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3dbe5d8/391bbba5e5fb4d0690ec6bb155425753/FLAG1c5586e31 [2024-10-24 06:23:16,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3dbe5d8/391bbba5e5fb4d0690ec6bb155425753 [2024-10-24 06:23:16,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:23:16,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:23:16,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:23:16,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:23:16,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:23:16,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288c46b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16, skipping insertion in model container [2024-10-24 06:23:16,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:23:16,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-24 06:23:16,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:23:16,405 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:23:16,417 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-24 06:23:16,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:23:16,498 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:23:16,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16 WrapperNode [2024-10-24 06:23:16,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:23:16,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:23:16,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:23:16,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:23:16,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,580 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-10-24 06:23:16,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:23:16,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:23:16,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:23:16,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:23:16,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:23:16,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:23:16,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:23:16,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:23:16,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:23:16,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (1/1) ... [2024-10-24 06:23:16,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:23:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:23:16,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:23:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:23:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:23:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:23:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:23:16,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:23:16,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:23:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:23:16,889 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:23:16,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:23:17,279 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 06:23:17,280 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:23:17,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:23:17,326 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:23:17,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:17 BoogieIcfgContainer [2024-10-24 06:23:17,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:23:17,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:23:17,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:23:17,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:23:17,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:23:16" (1/3) ... [2024-10-24 06:23:17,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3692ff66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:17, skipping insertion in model container [2024-10-24 06:23:17,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:16" (2/3) ... [2024-10-24 06:23:17,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3692ff66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:17, skipping insertion in model container [2024-10-24 06:23:17,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:17" (3/3) ... [2024-10-24 06:23:17,338 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:17,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:23:17,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:23:17,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:23:17,432 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cb6ea45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:23:17,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:23:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:23:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 06:23:17,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:17,457 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:17,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -617147977, now seen corresponding path program 1 times [2024-10-24 06:23:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629493111] [2024-10-24 06:23:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629493111] [2024-10-24 06:23:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629493111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:23:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700408522] [2024-10-24 06:23:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:23:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:23:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:23:18,145 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:23:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:18,195 INFO L93 Difference]: Finished difference Result 191 states and 337 transitions. [2024-10-24 06:23:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:23:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-10-24 06:23:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:18,207 INFO L225 Difference]: With dead ends: 191 [2024-10-24 06:23:18,208 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 06:23:18,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:23:18,219 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:18,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:23:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 06:23:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-24 06:23:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:23:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-24 06:23:18,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 199 [2024-10-24 06:23:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:18,369 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-24 06:23:18,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:23:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-24 06:23:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 06:23:18,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:18,377 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:18,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:23:18,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:18,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1696221605, now seen corresponding path program 1 times [2024-10-24 06:23:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522592822] [2024-10-24 06:23:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522592822] [2024-10-24 06:23:18,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522592822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:23:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643520465] [2024-10-24 06:23:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:23:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:23:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:23:18,845 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:18,909 INFO L93 Difference]: Finished difference Result 253 states and 395 transitions. [2024-10-24 06:23:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:23:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-24 06:23:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:18,918 INFO L225 Difference]: With dead ends: 253 [2024-10-24 06:23:18,919 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 06:23:18,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:23:18,922 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 96 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:18,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:23:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 06:23:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-10-24 06:23:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-24 06:23:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2024-10-24 06:23:18,954 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 199 [2024-10-24 06:23:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2024-10-24 06:23:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2024-10-24 06:23:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-24 06:23:18,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:18,959 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:23:18,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 107873703, now seen corresponding path program 1 times [2024-10-24 06:23:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258558384] [2024-10-24 06:23:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258558384] [2024-10-24 06:23:19,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258558384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:19,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:19,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:23:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593992867] [2024-10-24 06:23:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:19,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:23:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:23:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:23:19,679 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:19,972 INFO L93 Difference]: Finished difference Result 516 states and 811 transitions. [2024-10-24 06:23:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:23:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-24 06:23:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:19,981 INFO L225 Difference]: With dead ends: 516 [2024-10-24 06:23:19,981 INFO L226 Difference]: Without dead ends: 361 [2024-10-24 06:23:19,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:23:19,986 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:19,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:23:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-24 06:23:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 309. [2024-10-24 06:23:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 212 states have internal predecessors, (292), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-24 06:23:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 480 transitions. [2024-10-24 06:23:20,076 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 480 transitions. Word has length 199 [2024-10-24 06:23:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 480 transitions. [2024-10-24 06:23:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 480 transitions. [2024-10-24 06:23:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-24 06:23:20,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:20,081 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:23:20,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:20,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2136253968, now seen corresponding path program 1 times [2024-10-24 06:23:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787097127] [2024-10-24 06:23:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787097127] [2024-10-24 06:23:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787097127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:23:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831737683] [2024-10-24 06:23:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:23:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:23:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:23:20,463 INFO L87 Difference]: Start difference. First operand 309 states and 480 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:20,701 INFO L93 Difference]: Finished difference Result 929 states and 1446 transitions. [2024-10-24 06:23:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:23:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-10-24 06:23:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:20,712 INFO L225 Difference]: With dead ends: 929 [2024-10-24 06:23:20,713 INFO L226 Difference]: Without dead ends: 621 [2024-10-24 06:23:20,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:23:20,716 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 80 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:20,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 352 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:23:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-24 06:23:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2024-10-24 06:23:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 422 states have (on average 1.3791469194312795) internal successors, (582), 426 states have internal predecessors, (582), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-24 06:23:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 958 transitions. [2024-10-24 06:23:20,822 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 958 transitions. Word has length 200 [2024-10-24 06:23:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 958 transitions. [2024-10-24 06:23:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 958 transitions. [2024-10-24 06:23:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-24 06:23:20,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:20,829 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:20,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:23:20,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:20,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -878849650, now seen corresponding path program 1 times [2024-10-24 06:23:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018453485] [2024-10-24 06:23:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:23:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018453485] [2024-10-24 06:23:21,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018453485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:23:21,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362380894] [2024-10-24 06:23:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:21,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:23:21,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:23:21,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:23:21,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:23:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:21,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:23:21,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:23:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:23:22,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:23:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:23:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362380894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:23:22,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:23:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-24 06:23:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529539174] [2024-10-24 06:23:22,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:23:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 06:23:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 06:23:22,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 06:23:22,529 INFO L87 Difference]: Start difference. First operand 619 states and 958 transitions. Second operand has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-24 06:23:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:23,043 INFO L93 Difference]: Finished difference Result 1102 states and 1661 transitions. [2024-10-24 06:23:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 06:23:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 200 [2024-10-24 06:23:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:23,050 INFO L225 Difference]: With dead ends: 1102 [2024-10-24 06:23:23,050 INFO L226 Difference]: Without dead ends: 792 [2024-10-24 06:23:23,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-10-24 06:23:23,053 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 336 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:23,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 346 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:23:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-24 06:23:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 683. [2024-10-24 06:23:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 470 states have (on average 1.323404255319149) internal successors, (622), 474 states have internal predecessors, (622), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-24 06:23:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2024-10-24 06:23:23,149 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 200 [2024-10-24 06:23:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:23,149 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2024-10-24 06:23:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-24 06:23:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2024-10-24 06:23:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-24 06:23:23,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:23,153 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:23,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:23:23,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:23:23,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:23,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -436033535, now seen corresponding path program 1 times [2024-10-24 06:23:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144180252] [2024-10-24 06:23:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:23:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:23:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:23:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:23:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:23:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:23:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:23:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:23:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:23:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:23:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 06:23:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 06:23:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 06:23:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 06:23:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 06:23:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 06:23:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 06:23:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 06:23:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 06:23:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 06:23:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 06:23:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 06:23:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 06:23:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 06:23:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 06:23:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 06:23:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 06:23:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 06:23:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 06:23:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 06:23:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 06:23:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:23:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144180252] [2024-10-24 06:23:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144180252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:23:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543362405] [2024-10-24 06:23:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:23:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:23:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:23:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:23:23,538 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:23,621 INFO L93 Difference]: Finished difference Result 1365 states and 1995 transitions. [2024-10-24 06:23:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:23:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-24 06:23:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:23,666 INFO L225 Difference]: With dead ends: 1365 [2024-10-24 06:23:23,666 INFO L226 Difference]: Without dead ends: 683 [2024-10-24 06:23:23,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:23:23,669 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:23,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:23:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-24 06:23:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-10-24 06:23:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 470 states have (on average 1.3063829787234043) internal successors, (614), 474 states have internal predecessors, (614), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-24 06:23:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 990 transitions. [2024-10-24 06:23:23,740 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 990 transitions. Word has length 201 [2024-10-24 06:23:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:23,740 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 990 transitions. [2024-10-24 06:23:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:23:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 990 transitions. [2024-10-24 06:23:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-24 06:23:23,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:23,743 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:23,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:23:23,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1575682659, now seen corresponding path program 1 times [2024-10-24 06:23:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:23:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672378146] [2024-10-24 06:23:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:23:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:23:23,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:23:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:23:23,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:23:23,975 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:23:23,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:23:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:23:23,984 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:24,141 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:23:24,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:23:24 BoogieIcfgContainer [2024-10-24 06:23:24,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:23:24,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:23:24,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:23:24,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:23:24,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:17" (3/4) ... [2024-10-24 06:23:24,149 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:23:24,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:23:24,150 INFO L158 Benchmark]: Toolchain (without parser) took 8081.21ms. Allocated memory was 142.6MB in the beginning and 239.1MB in the end (delta: 96.5MB). Free memory was 72.7MB in the beginning and 103.9MB in the end (delta: -31.2MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,151 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:23:24,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.96ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 111.3MB in the end (delta: -38.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.71ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 111.2MB in the beginning and 164.7MB in the end (delta: -53.5MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,153 INFO L158 Benchmark]: Boogie Preprocessor took 85.80ms. Allocated memory is still 195.0MB. Free memory was 164.7MB in the beginning and 161.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,153 INFO L158 Benchmark]: RCFGBuilder took 655.30ms. Allocated memory is still 195.0MB. Free memory was 160.5MB in the beginning and 133.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,153 INFO L158 Benchmark]: TraceAbstraction took 6815.80ms. Allocated memory was 195.0MB in the beginning and 239.1MB in the end (delta: 44.0MB). Free memory was 132.2MB in the beginning and 103.9MB in the end (delta: 28.3MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-10-24 06:23:24,154 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 239.1MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:23:24,155 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.96ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 111.3MB in the end (delta: -38.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.71ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 111.2MB in the beginning and 164.7MB in the end (delta: -53.5MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.80ms. Allocated memory is still 195.0MB. Free memory was 164.7MB in the beginning and 161.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 655.30ms. Allocated memory is still 195.0MB. Free memory was 160.5MB in the beginning and 133.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6815.80ms. Allocated memory was 195.0MB in the beginning and 239.1MB in the end (delta: 44.0MB). Free memory was 132.2MB in the beginning and 103.9MB in the end (delta: 28.3MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 239.1MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] signed char var_1_26 = 32; [L43] unsigned long int var_1_27 = 64; [L44] unsigned char var_1_28 = 0; [L45] unsigned long int var_1_29 = 32; [L46] unsigned char var_1_30 = 10; [L47] unsigned char var_1_31 = 10; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] unsigned char var_1_34 = 8; [L51] unsigned char var_1_35 = 128; [L52] float var_1_36 = 7.5; [L53] float var_1_37 = 2.5; [L54] unsigned char last_1_var_1_1 = 1; [L55] signed long int last_1_var_1_11 = -2; [L56] signed long int last_1_var_1_15 = 1000; [L57] double last_1_var_1_16 = 0.2; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_11 = var_1_11 [L185] last_1_var_1_15 = var_1_15 [L186] last_1_var_1_16 = var_1_16 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L131] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L133] var_1_7 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L134] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L135] var_1_10 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L136] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L137] var_1_13 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L138] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L140] var_1_14 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L141] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L143] var_1_17 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L144] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L145] var_1_18 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L146] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L147] var_1_20 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L148] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L149] var_1_21 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L150] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L151] var_1_22 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L152] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L153] var_1_23 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L155] var_1_26 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L156] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] var_1_29 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_29 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_29 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] var_1_31 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] CALL assume_abort_if_not(var_1_31 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_31 <= 64) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] var_1_32 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_33 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_34 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] var_1_35 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET updateVariables() [L198] CALL step() [L61] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L62] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L64] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L65] COND TRUE var_1_20 <= var_1_22 [L66] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] EXPR var_1_25 | var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND FALSE !((var_1_26 <= (var_1_25 | var_1_19)) || var_1_28) [L71] COND FALSE !(\read(var_1_28)) [L74] var_1_30 = (((((var_1_35 - var_1_34)) > (var_1_31)) ? ((var_1_35 - var_1_34)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L76] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L77] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L78] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L79] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L84] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L85] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L86] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L88] signed long int stepLocal_2 = var_1_11; [L89] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L90] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L91] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L92] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L93] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L99] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L99] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L110] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L112] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L113] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L117] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L118] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L119] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L189-L190] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 1851 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 979 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 872 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 806 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 166 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1600 NumberOfCodeBlocks, 1600 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1590 ConstructedInterpolants, 0 QuantifiedInterpolants, 3664 SizeOfPredicates, 1 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 14526/14880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:23:24,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:23:26,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:23:26,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:23:26,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:23:26,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:23:26,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:23:26,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:23:26,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:23:26,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:23:26,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:23:26,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:23:26,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:23:26,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:23:26,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:23:26,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:23:26,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:23:26,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:23:26,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:23:26,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:23:26,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:23:26,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:23:26,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:23:26,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:23:26,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:23:26,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:23:26,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:23:26,734 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:23:26,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:23:26,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:23:26,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:23:26,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:23:26,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:23:26,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:23:26,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:23:26,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:23:26,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:23:26,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:23:26,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:23:26,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:23:26,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:23:26,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:23:26,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:23:26,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:23:26,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:23:26,741 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:23:26,741 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-10-24 06:23:27,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:23:27,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:23:27,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:23:27,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:23:27,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:23:27,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:28,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:23:29,011 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:23:29,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:29,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc2f04a9/a7b6594a6cc147eba078b0231f3e89f2/FLAGbbe47a1fe [2024-10-24 06:23:29,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc2f04a9/a7b6594a6cc147eba078b0231f3e89f2 [2024-10-24 06:23:29,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:23:29,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:23:29,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:23:29,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:23:29,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:23:29,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16389132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29, skipping insertion in model container [2024-10-24 06:23:29,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:23:29,583 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-24 06:23:29,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:23:29,680 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:23:29,697 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-24 06:23:29,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:23:29,782 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:23:29,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29 WrapperNode [2024-10-24 06:23:29,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:23:29,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:23:29,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:23:29,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:23:29,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,850 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-24 06:23:29,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:23:29,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:23:29,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:23:29,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:23:29,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:23:29,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:23:29,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:23:29,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:23:29,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:23:29,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (1/1) ... [2024-10-24 06:23:29,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:23:29,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:23:29,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:23:29,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:23:30,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:23:30,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:23:30,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:23:30,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:23:30,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:23:30,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:23:30,178 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:23:30,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:23:46,270 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:23:46,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:23:46,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:23:46,343 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:23:46,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:46 BoogieIcfgContainer [2024-10-24 06:23:46,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:23:46,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:23:46,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:23:46,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:23:46,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:23:29" (1/3) ... [2024-10-24 06:23:46,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f477667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:46, skipping insertion in model container [2024-10-24 06:23:46,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:23:29" (2/3) ... [2024-10-24 06:23:46,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f477667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:23:46, skipping insertion in model container [2024-10-24 06:23:46,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:23:46" (3/3) ... [2024-10-24 06:23:46,356 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-24 06:23:46,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:23:46,375 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:23:46,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:23:46,460 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38daacf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:23:46,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:23:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:23:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:23:46,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:46,483 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:46,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1261669085, now seen corresponding path program 1 times [2024-10-24 06:23:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:23:46,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837314364] [2024-10-24 06:23:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:46,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:23:46,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:23:46,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:23:46,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:23:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:47,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:23:47,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:23:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-10-24 06:23:47,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:23:47,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:23:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837314364] [2024-10-24 06:23:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837314364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:23:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194056370] [2024-10-24 06:23:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:47,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:23:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:23:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:23:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:23:47,414 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:23:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:23:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:23:51,619 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-10-24 06:23:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:23:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2024-10-24 06:23:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:23:51,679 INFO L225 Difference]: With dead ends: 167 [2024-10-24 06:23:51,679 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 06:23:51,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:23:51,689 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:23:51,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 06:23:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 06:23:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 06:23:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:23:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-24 06:23:51,745 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 195 [2024-10-24 06:23:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:23:51,745 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-24 06:23:51,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:23:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-24 06:23:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:23:51,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:23:51,751 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:23:51,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:23:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:23:51,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:23:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:23:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1492440081, now seen corresponding path program 1 times [2024-10-24 06:23:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:23:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245704419] [2024-10-24 06:23:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:23:51,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:23:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:23:51,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:23:51,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:23:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:23:52,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:23:52,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:23:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:23:55,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:23:55,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:23:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245704419] [2024-10-24 06:23:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245704419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:23:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:23:55,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:23:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619355743] [2024-10-24 06:23:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:23:55,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:23:55,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:23:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:23:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:23:55,576 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:00,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:04,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:12,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:16,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:17,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:17,776 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2024-10-24 06:24:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:24:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-24 06:24:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:17,834 INFO L225 Difference]: With dead ends: 264 [2024-10-24 06:24:17,834 INFO L226 Difference]: Without dead ends: 182 [2024-10-24 06:24:17,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:17,836 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:17,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 392 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 17 Invalid, 5 Unknown, 0 Unchecked, 22.1s Time] [2024-10-24 06:24:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-24 06:24:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2024-10-24 06:24:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:24:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 255 transitions. [2024-10-24 06:24:17,883 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 255 transitions. Word has length 195 [2024-10-24 06:24:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:17,884 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 255 transitions. [2024-10-24 06:24:17,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 255 transitions. [2024-10-24 06:24:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:24:17,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:17,889 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:17,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 06:24:18,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:18,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:18,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2041267944, now seen corresponding path program 1 times [2024-10-24 06:24:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:18,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095287762] [2024-10-24 06:24:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:18,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:18,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:24:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:18,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:24:18,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:24:23,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:24:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:24:25,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095287762] [2024-10-24 06:24:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095287762] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:24:25,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:24:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-24 06:24:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022593836] [2024-10-24 06:24:25,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:24:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 06:24:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 06:24:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 06:24:25,118 INFO L87 Difference]: Start difference. First operand 163 states and 255 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-24 06:24:32,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:34,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:34,784 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2024-10-24 06:24:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 06:24:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 196 [2024-10-24 06:24:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:34,789 INFO L225 Difference]: With dead ends: 266 [2024-10-24 06:24:34,789 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 06:24:34,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-10-24 06:24:34,791 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 192 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 131 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:34,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 329 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 329 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-10-24 06:24:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 06:24:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2024-10-24 06:24:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 110 states have internal predecessors, (141), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:24:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 265 transitions. [2024-10-24 06:24:34,835 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 265 transitions. Word has length 196 [2024-10-24 06:24:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 265 transitions. [2024-10-24 06:24:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-24 06:24:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 265 transitions. [2024-10-24 06:24:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:24:34,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:34,841 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:34,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:24:35,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:35,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:35,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 783584183, now seen corresponding path program 1 times [2024-10-24 06:24:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455230384] [2024-10-24 06:24:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:35,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:35,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:24:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:35,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:24:35,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:24:35,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:35,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455230384] [2024-10-24 06:24:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455230384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223672686] [2024-10-24 06:24:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:35,772 INFO L87 Difference]: Start difference. First operand 179 states and 265 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:40,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:41,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:24:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:41,701 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2024-10-24 06:24:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:24:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:41,704 INFO L225 Difference]: With dead ends: 357 [2024-10-24 06:24:41,705 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 06:24:41,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:41,707 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:41,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-10-24 06:24:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 06:24:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-24 06:24:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 110 states have internal predecessors, (139), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:24:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions. [2024-10-24 06:24:41,753 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 197 [2024-10-24 06:24:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 263 transitions. [2024-10-24 06:24:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:24:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2024-10-24 06:24:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-24 06:24:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:41,758 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:41,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:24:41,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:41,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1928816013, now seen corresponding path program 1 times [2024-10-24 06:24:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507483835] [2024-10-24 06:24:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:41,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:41,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:41,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 06:24:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 06:24:42,645 INFO L278 TraceCheckSpWp]: Computing forward predicates...