./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_fillercodestructure_filler-pr-cn_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_fillercodestructure_filler-pr-cn_file-74.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 610fd8be49619d4483b126b9e1bb736f24928e80c643bc2583d3a3df2e2d0c88 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:24:26,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:24:26,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:24:26,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:24:26,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:24:26,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:24:26,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:24:26,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:24:26,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:24:26,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:24:26,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:24:26,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:24:26,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:24:26,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:24:26,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:24:26,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:24:26,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:24:26,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:24:26,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:24:26,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:24:26,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:24:26,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:24:26,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:24:26,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:24:26,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:24:26,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:24:26,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:24:26,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:24:26,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:24:26,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:24:26,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:24:26,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:24:26,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:24:26,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:24:26,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:24:26,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:24:26,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:24:26,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:24:26,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:24:26,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:24:26,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:24:26,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:24:26,338 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 -> 610fd8be49619d4483b126b9e1bb736f24928e80c643bc2583d3a3df2e2d0c88 [2024-10-13 02:24:26,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:24:26,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:24:26,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:24:26,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:24:26,620 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:24:26,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:28,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:24:28,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:24:28,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:28,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be55cd93/36eb480b19654a1b98cce2bf188f4879/FLAG4f9d0d1ee [2024-10-13 02:24:28,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be55cd93/36eb480b19654a1b98cce2bf188f4879 [2024-10-13 02:24:28,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:24:28,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:24:28,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:24:28,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:24:28,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:24:28,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:24:28" (1/1) ... [2024-10-13 02:24:28,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:28, skipping insertion in model container [2024-10-13 02:24:28,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:24:28" (1/1) ... [2024-10-13 02:24:28,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:24:28,844 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_fillercodestructure_filler-pr-cn_file-74.i[919,932] [2024-10-13 02:24:28,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:24:28,965 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:24:28,979 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_fillercodestructure_filler-pr-cn_file-74.i[919,932] [2024-10-13 02:24:29,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:24:29,058 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:24:29,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29 WrapperNode [2024-10-13 02:24:29,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:24:29,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:24:29,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:24:29,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:24:29,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,132 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-10-13 02:24:29,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:24:29,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:24:29,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:24:29,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:24:29,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,184 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-13 02:24:29,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:24:29,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:24:29,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:24:29,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:24:29,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (1/1) ... [2024-10-13 02:24:29,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:24:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:24:29,250 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-13 02:24:29,252 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-13 02:24:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:24:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:24:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:24:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:24:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:24:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:24:29,376 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:24:29,377 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:24:29,824 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 02:24:29,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:24:29,868 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:24:29,869 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:24:29,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:24:29 BoogieIcfgContainer [2024-10-13 02:24:29,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:24:29,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:24:29,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:24:29,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:24:29,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:24:28" (1/3) ... [2024-10-13 02:24:29,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bce4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:24:29, skipping insertion in model container [2024-10-13 02:24:29,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:29" (2/3) ... [2024-10-13 02:24:29,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bce4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:24:29, skipping insertion in model container [2024-10-13 02:24:29,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:24:29" (3/3) ... [2024-10-13 02:24:29,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:29,899 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:24:29,899 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:24:29,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:24:29,979 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;@2ed90953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:24:29,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:24:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 02:24:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 02:24:29,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:29,998 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:29,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:30,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -140818650, now seen corresponding path program 1 times [2024-10-13 02:24:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416726393] [2024-10-13 02:24:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416726393] [2024-10-13 02:24:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416726393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:24:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305927990] [2024-10-13 02:24:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:24:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:24:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:24:30,618 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 02:24:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:30,675 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2024-10-13 02:24:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:24:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 228 [2024-10-13 02:24:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:30,692 INFO L225 Difference]: With dead ends: 224 [2024-10-13 02:24:30,692 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 02:24:30,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-13 02:24:30,703 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:30,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:24:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 02:24:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-13 02:24:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 02:24:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-10-13 02:24:30,761 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 228 [2024-10-13 02:24:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-10-13 02:24:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 02:24:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-10-13 02:24:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 02:24:30,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:30,767 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:30,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:24:30,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1079825492, now seen corresponding path program 1 times [2024-10-13 02:24:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287811043] [2024-10-13 02:24:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287811043] [2024-10-13 02:24:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287811043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:24:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901359697] [2024-10-13 02:24:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:31,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:24:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:24:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:24:31,225 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:31,307 INFO L93 Difference]: Finished difference Result 255 states and 390 transitions. [2024-10-13 02:24:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:24:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-13 02:24:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:31,311 INFO L225 Difference]: With dead ends: 255 [2024-10-13 02:24:31,315 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 02:24:31,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-13 02:24:31,317 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 44 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:31,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 328 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:24:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 02:24:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-10-13 02:24:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 96 states have internal predecessors, (128), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:24:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 216 transitions. [2024-10-13 02:24:31,354 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 216 transitions. Word has length 228 [2024-10-13 02:24:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 216 transitions. [2024-10-13 02:24:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 216 transitions. [2024-10-13 02:24:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 02:24:31,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:31,362 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:31,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:24:31,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1759883862, now seen corresponding path program 1 times [2024-10-13 02:24:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:31,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822617659] [2024-10-13 02:24:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822617659] [2024-10-13 02:24:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822617659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:24:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503818502] [2024-10-13 02:24:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:24:31,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:24:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:24:31,772 INFO L87 Difference]: Start difference. First operand 142 states and 216 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:31,830 INFO L93 Difference]: Finished difference Result 283 states and 431 transitions. [2024-10-13 02:24:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:24:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-13 02:24:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:31,835 INFO L225 Difference]: With dead ends: 283 [2024-10-13 02:24:31,835 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 02:24:31,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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-13 02:24:31,839 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:31,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 157 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:24:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 02:24:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 02:24:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 96 states have internal predecessors, (126), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:24:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 214 transitions. [2024-10-13 02:24:31,876 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 214 transitions. Word has length 228 [2024-10-13 02:24:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 214 transitions. [2024-10-13 02:24:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 214 transitions. [2024-10-13 02:24:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-13 02:24:31,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:31,882 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:24:31,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -3085645, now seen corresponding path program 1 times [2024-10-13 02:24:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698067265] [2024-10-13 02:24:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698067265] [2024-10-13 02:24:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698067265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:32,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:24:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063730467] [2024-10-13 02:24:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:32,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:24:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:24:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:24:32,728 INFO L87 Difference]: Start difference. First operand 142 states and 214 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:32,845 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2024-10-13 02:24:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:24:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 230 [2024-10-13 02:24:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:32,849 INFO L225 Difference]: With dead ends: 365 [2024-10-13 02:24:32,849 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 02:24:32,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 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-13 02:24:32,852 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 141 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:32,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 697 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:24:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 02:24:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2024-10-13 02:24:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 125 states have internal predecessors, (152), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 02:24:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 312 transitions. [2024-10-13 02:24:32,919 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 312 transitions. Word has length 230 [2024-10-13 02:24:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 312 transitions. [2024-10-13 02:24:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 312 transitions. [2024-10-13 02:24:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-13 02:24:32,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:32,925 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:32,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:24:32,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash 743058658, now seen corresponding path program 1 times [2024-10-13 02:24:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910376920] [2024-10-13 02:24:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910376920] [2024-10-13 02:24:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910376920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:24:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106146650] [2024-10-13 02:24:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:33,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:24:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:24:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:24:33,671 INFO L87 Difference]: Start difference. First operand 208 states and 312 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:34,063 INFO L93 Difference]: Finished difference Result 414 states and 616 transitions. [2024-10-13 02:24:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:24:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 232 [2024-10-13 02:24:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:34,067 INFO L225 Difference]: With dead ends: 414 [2024-10-13 02:24:34,067 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 02:24:34,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:24:34,069 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 121 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:34,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 562 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:24:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 02:24:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 210. [2024-10-13 02:24:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 125 states have (on average 1.232) internal successors, (154), 126 states have internal predecessors, (154), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 02:24:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2024-10-13 02:24:34,121 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 232 [2024-10-13 02:24:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:34,122 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2024-10-13 02:24:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2024-10-13 02:24:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 02:24:34,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:34,125 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:34,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:24:34,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:34,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash 938808490, now seen corresponding path program 1 times [2024-10-13 02:24:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887267534] [2024-10-13 02:24:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887267534] [2024-10-13 02:24:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887267534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:24:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550449765] [2024-10-13 02:24:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:34,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:24:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:24:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:24:34,744 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:35,098 INFO L93 Difference]: Finished difference Result 414 states and 615 transitions. [2024-10-13 02:24:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:24:35,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 233 [2024-10-13 02:24:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:35,101 INFO L225 Difference]: With dead ends: 414 [2024-10-13 02:24:35,102 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 02:24:35,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:24:35,103 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 119 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:35,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 563 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:24:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 02:24:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 211. [2024-10-13 02:24:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 127 states have internal predecessors, (155), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 02:24:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 315 transitions. [2024-10-13 02:24:35,147 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 315 transitions. Word has length 233 [2024-10-13 02:24:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:35,147 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 315 transitions. [2024-10-13 02:24:35,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 315 transitions. [2024-10-13 02:24:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 02:24:35,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:35,151 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:35,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:24:35,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 429335400, now seen corresponding path program 1 times [2024-10-13 02:24:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:35,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289578926] [2024-10-13 02:24:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:24:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:24:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:24:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:24:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:24:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:24:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:24:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:24:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:24:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:24:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:24:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:24:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:24:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:24:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:24:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:24:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:24:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:24:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:24:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:24:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:24:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:24:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:24:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:24:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:24:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:24:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:24:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:24:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:24:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:24:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:24:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:24:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:24:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:24:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:24:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-13 02:24:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-13 02:24:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:24:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289578926] [2024-10-13 02:24:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289578926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:24:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896953288] [2024-10-13 02:24:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:35,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:24:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:24:35,486 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-13 02:24:35,487 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-13 02:24:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:35,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 02:24:35,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:24:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1139 proven. 33 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-10-13 02:24:35,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:24:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-13 02:24:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896953288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:24:36,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:24:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-13 02:24:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734993761] [2024-10-13 02:24:36,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:24:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 02:24:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:24:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 02:24:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:24:36,172 INFO L87 Difference]: Start difference. First operand 211 states and 315 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-13 02:24:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:36,562 INFO L93 Difference]: Finished difference Result 368 states and 540 transitions. [2024-10-13 02:24:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:24:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 233 [2024-10-13 02:24:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:36,566 INFO L225 Difference]: With dead ends: 368 [2024-10-13 02:24:36,566 INFO L226 Difference]: Without dead ends: 227 [2024-10-13 02:24:36,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:24:36,567 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 169 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:36,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 431 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:24:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-13 02:24:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2024-10-13 02:24:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 133 states have internal predecessors, (160), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 02:24:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2024-10-13 02:24:36,614 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 233 [2024-10-13 02:24:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:36,614 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2024-10-13 02:24:36,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-13 02:24:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2024-10-13 02:24:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-13 02:24:36,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:36,619 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:36,637 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-13 02:24:36,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:24:36,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:36,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1481064305, now seen corresponding path program 1 times [2024-10-13 02:24:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:24:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811229047] [2024-10-13 02:24:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:24:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:24:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875464397] [2024-10-13 02:24:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:24:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:24:36,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:24:36,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:24:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:24:37,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:24:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:24:37,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:24:37,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:24:37,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:24:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:24:37,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 02:24:37,524 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:24:37,675 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:24:37,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:24:37 BoogieIcfgContainer [2024-10-13 02:24:37,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:24:37,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:24:37,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:24:37,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:24:37,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:24:29" (3/4) ... [2024-10-13 02:24:37,681 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:24:37,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:24:37,683 INFO L158 Benchmark]: Toolchain (without parser) took 9082.14ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 97.9MB in the beginning and 94.6MB in the end (delta: 3.3MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,683 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:24:37,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.12ms. Allocated memory is still 153.1MB. Free memory was 97.9MB in the beginning and 80.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.12ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 76.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,684 INFO L158 Benchmark]: Boogie Preprocessor took 80.13ms. Allocated memory is still 153.1MB. Free memory was 76.4MB in the beginning and 71.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,684 INFO L158 Benchmark]: RCFGBuilder took 654.57ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 71.9MB in the beginning and 143.8MB in the end (delta: -72.0MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,684 INFO L158 Benchmark]: TraceAbstraction took 7806.58ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 142.8MB in the beginning and 94.6MB in the end (delta: 48.2MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2024-10-13 02:24:37,684 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 285.2MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:24:37,686 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.17ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.12ms. Allocated memory is still 153.1MB. Free memory was 97.9MB in the beginning and 80.2MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.12ms. Allocated memory is still 153.1MB. Free memory was 80.2MB in the beginning and 76.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.13ms. Allocated memory is still 153.1MB. Free memory was 76.4MB in the beginning and 71.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 654.57ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 71.9MB in the beginning and 143.8MB in the end (delta: -72.0MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7806.58ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 142.8MB in the beginning and 94.6MB in the end (delta: 48.2MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 285.2MB. Free memory is still 94.6MB. 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 208, overapproximation of bitwiseOr at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 208, overapproximation of someBinaryArithmeticFLOAToperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] unsigned long int var_1_26 = 2; [L44] signed char var_1_27 = 4; [L45] float var_1_28 = 3.5; [L46] signed short int var_1_29 = -8; [L47] signed short int var_1_30 = 256; [L48] signed char var_1_31 = -32; [L49] signed char var_1_32 = 2; [L50] unsigned char var_1_33 = 0; [L51] signed long int var_1_34 = -4; [L52] unsigned char var_1_35 = 1; [L53] unsigned char var_1_36 = 1; [L54] float var_1_37 = 32.2; [L55] double var_1_38 = 0.5; [L56] double var_1_39 = 255.8; [L57] unsigned long int last_1_var_1_1 = 64; [L58] unsigned char last_1_var_1_11 = 50; [L212] isInitial = 1 [L213] FCALL initially() [L214] COND TRUE 1 [L215] CALL updateLastVariables() [L204] last_1_var_1_1 = var_1_1 [L205] last_1_var_1_11 = var_1_11 [L215] RET updateLastVariables() [L216] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L147] var_1_5 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L150] var_1_7 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_12 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_13 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] var_1_16 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_17 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_19 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] var_1_20 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] var_1_22 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L177] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] var_1_23 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L179] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180] var_1_26 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L181] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_26 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_26 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L183] var_1_27 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L184] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L186] var_1_30 = __VERIFIER_nondet_short() [L187] CALL assume_abort_if_not(var_1_30 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187] RET assume_abort_if_not(var_1_30 >= -32766) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_30 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L188] RET assume_abort_if_not(var_1_30 <= 32766) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L189] var_1_33 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L190] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L191] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L191] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L192] var_1_35 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L193] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L194] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L194] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L195] var_1_36 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L196] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L197] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L197] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L198] var_1_37 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L199] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L200] var_1_39 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L201] RET assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L216] RET updateVariables() [L217] CALL step() [L62] signed long int stepLocal_1 = last_1_var_1_11; [L63] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L64] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L65] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND TRUE ((((var_1_31) < (var_1_27)) ? (var_1_31) : (var_1_27))) <= var_1_30 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L70] COND FALSE !(\read(var_1_33)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L86] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L87] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L87] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L88] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L99] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L101] COND TRUE (~ (5 + var_1_26)) >= 10000u [L102] var_1_29 = (((((var_1_25 + var_1_27)) > (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))))) ? ((var_1_25 + var_1_27)) : (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] EXPR var_1_25 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] EXPR ((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] EXPR var_1_25 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] EXPR ((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] COND FALSE !(var_1_30 <= ((((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5))))) [L111] var_1_38 = var_1_39 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] COND FALSE !(! (var_1_11 >= var_1_11)) [L119] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L121] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] COND FALSE !((~ (var_1_26 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] COND FALSE !(\read(var_1_10)) [L132] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L134] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L135] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L138] COND TRUE var_1_25 > var_1_26 [L139] var_1_28 = ((((4.2f) < (1.25f)) ? (4.2f) : (1.25f))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_31 = var_1_27 [L217] RET step() [L218] CALL, EXPR property() [L208] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208-L209] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L218] RET, EXPR property() [L218] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=0, var_1_28=21/5, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 2906 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1693 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 691 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 1213 mSDtfsCounter, 691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2319 NumberOfCodeBlocks, 2319 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2069 ConstructedInterpolants, 0 QuantifiedInterpolants, 4389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 22581/22680 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-13 02:24:37,723 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_fillercodestructure_filler-pr-cn_file-74.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 610fd8be49619d4483b126b9e1bb736f24928e80c643bc2583d3a3df2e2d0c88 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:24:39,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:24:40,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:24:40,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:24:40,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:24:40,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:24:40,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:24:40,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:24:40,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:24:40,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:24:40,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:24:40,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:24:40,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:24:40,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:24:40,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:24:40,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:24:40,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:24:40,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:24:40,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:24:40,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:24:40,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:24:40,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:24:40,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:24:40,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:24:40,072 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:24:40,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:24:40,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:24:40,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:24:40,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:24:40,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:24:40,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:24:40,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:24:40,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:24:40,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:24:40,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:24:40,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:24:40,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:24:40,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:24:40,076 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:24:40,076 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:24:40,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:24:40,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:24:40,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:24:40,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:24:40,077 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:24:40,077 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 -> 610fd8be49619d4483b126b9e1bb736f24928e80c643bc2583d3a3df2e2d0c88 [2024-10-13 02:24:40,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:24:40,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:24:40,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:24:40,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:24:40,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:24:40,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:41,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:24:42,195 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:24:42,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:42,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc08d8a7/4d6bbe87a6aa4a54b8ab26a722e021cc/FLAG0911ee0d9 [2024-10-13 02:24:42,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc08d8a7/4d6bbe87a6aa4a54b8ab26a722e021cc [2024-10-13 02:24:42,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:24:42,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:24:42,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:24:42,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:24:42,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:24:42,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe00c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42, skipping insertion in model container [2024-10-13 02:24:42,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:24:42,479 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_fillercodestructure_filler-pr-cn_file-74.i[919,932] [2024-10-13 02:24:42,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:24:42,608 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:24:42,624 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_fillercodestructure_filler-pr-cn_file-74.i[919,932] [2024-10-13 02:24:42,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:24:42,711 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:24:42,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42 WrapperNode [2024-10-13 02:24:42,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:24:42,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:24:42,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:24:42,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:24:42,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,786 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-13 02:24:42,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:24:42,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:24:42,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:24:42,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:24:42,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,836 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-13 02:24:42,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:24:42,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:24:42,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:24:42,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:24:42,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (1/1) ... [2024-10-13 02:24:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:24:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:24:42,925 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-13 02:24:42,931 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-13 02:24:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:24:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:24:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:24:42,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:24:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:24:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:24:43,090 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:24:43,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:24:45,530 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:24:45,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:24:45,609 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:24:45,609 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:24:45,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:24:45 BoogieIcfgContainer [2024-10-13 02:24:45,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:24:45,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:24:45,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:24:45,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:24:45,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:24:42" (1/3) ... [2024-10-13 02:24:45,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674cdde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:24:45, skipping insertion in model container [2024-10-13 02:24:45,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:24:42" (2/3) ... [2024-10-13 02:24:45,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674cdde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:24:45, skipping insertion in model container [2024-10-13 02:24:45,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:24:45" (3/3) ... [2024-10-13 02:24:45,630 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-74.i [2024-10-13 02:24:45,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:24:45,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:24:45,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:24:45,729 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;@625fa08c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:24:45,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:24:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 02:24:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 02:24:45,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:45,757 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:45,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:45,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash 876425055, now seen corresponding path program 1 times [2024-10-13 02:24:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:24:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239775450] [2024-10-13 02:24:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:45,781 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-13 02:24:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:24:45,784 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-13 02:24:45,820 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-13 02:24:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:46,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:24:46,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:24:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-13 02:24:46,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:24:46,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:24:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239775450] [2024-10-13 02:24:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239775450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:46,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:24:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094787579] [2024-10-13 02:24:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:46,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:24:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:24:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:24:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:24:46,411 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 02:24:48,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:24:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:48,862 INFO L93 Difference]: Finished difference Result 188 states and 344 transitions. [2024-10-13 02:24:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:24:48,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2024-10-13 02:24:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:48,894 INFO L225 Difference]: With dead ends: 188 [2024-10-13 02:24:48,895 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 02:24:48,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 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-13 02:24:48,901 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:48,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 02:24:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 02:24:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 02:24:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 02:24:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 147 transitions. [2024-10-13 02:24:48,952 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 147 transitions. Word has length 222 [2024-10-13 02:24:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:48,953 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 147 transitions. [2024-10-13 02:24:48,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 02:24:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 147 transitions. [2024-10-13 02:24:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 02:24:48,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:48,958 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:48,973 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-13 02:24:49,159 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-13 02:24:49,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 730146829, now seen corresponding path program 1 times [2024-10-13 02:24:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:24:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498854915] [2024-10-13 02:24:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:49,162 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-13 02:24:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:24:49,166 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-13 02:24:49,168 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-13 02:24:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:49,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:24:49,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:24:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:51,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:24:51,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:24:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498854915] [2024-10-13 02:24:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498854915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:51,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:51,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:24:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950118647] [2024-10-13 02:24:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:24:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:24:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:24:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:24:51,773 INFO L87 Difference]: Start difference. First operand 93 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:53,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:24:55,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:24:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:24:55,888 INFO L93 Difference]: Finished difference Result 278 states and 440 transitions. [2024-10-13 02:24:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:24:55,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-13 02:24:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:24:55,914 INFO L225 Difference]: With dead ends: 278 [2024-10-13 02:24:55,914 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 02:24:55,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:24:55,917 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:24:55,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 480 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 02:24:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 02:24:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2024-10-13 02:24:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 02:24:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-10-13 02:24:55,974 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 222 [2024-10-13 02:24:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:24:55,977 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-10-13 02:24:55,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:24:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-10-13 02:24:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 02:24:55,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:24:55,987 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:24:56,007 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-13 02:24:56,187 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-13 02:24:56,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:24:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:24:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 777556293, now seen corresponding path program 1 times [2024-10-13 02:24:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:24:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441744309] [2024-10-13 02:24:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:24:56,190 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-13 02:24:56,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:24:56,192 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-13 02:24:56,193 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-13 02:24:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:24:56,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:24:56,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:24:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 02:24:58,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:24:58,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:24:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441744309] [2024-10-13 02:24:58,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441744309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:24:58,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:24:58,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:24:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265057303] [2024-10-13 02:24:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:24:58,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:24:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:24:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:24:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:24:58,421 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:25:00,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:25:02,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:25:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:25:02,570 INFO L93 Difference]: Finished difference Result 278 states and 439 transitions. [2024-10-13 02:25:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:25:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-13 02:25:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:25:02,596 INFO L225 Difference]: With dead ends: 278 [2024-10-13 02:25:02,596 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 02:25:02,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:25:02,599 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 90 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:25:02,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 481 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 02:25:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 02:25:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2024-10-13 02:25:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 02:25:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2024-10-13 02:25:02,639 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 223 [2024-10-13 02:25:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:25:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2024-10-13 02:25:02,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 02:25:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2024-10-13 02:25:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 02:25:02,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:25:02,652 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:25:02,669 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:25:02,852 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-13 02:25:02,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:25:02,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:25:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1216588413, now seen corresponding path program 1 times [2024-10-13 02:25:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:25:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132499635] [2024-10-13 02:25:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:25:02,855 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-13 02:25:02,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:25:02,858 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-13 02:25:02,859 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-13 02:25:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:25:03,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:25:03,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:25:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 989 proven. 78 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2024-10-13 02:25:03,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:25:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 27 proven. 78 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-13 02:25:04,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:25:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132499635] [2024-10-13 02:25:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132499635] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:25:04,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:25:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 02:25:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376704345] [2024-10-13 02:25:04,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:25:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:25:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:25:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:25:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:25:04,174 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-13 02:25:06,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:25:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:25:07,024 INFO L93 Difference]: Finished difference Result 265 states and 405 transitions. [2024-10-13 02:25:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:25:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 223 [2024-10-13 02:25:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:25:07,027 INFO L225 Difference]: With dead ends: 265 [2024-10-13 02:25:07,028 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 02:25:07,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:25:07,031 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:25:07,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 225 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 02:25:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 02:25:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2024-10-13 02:25:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 02:25:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2024-10-13 02:25:07,061 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 223 [2024-10-13 02:25:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:25:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2024-10-13 02:25:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-13 02:25:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2024-10-13 02:25:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 02:25:07,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:25:07,067 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:25:07,085 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 (5)] Ended with exit code 0 [2024-10-13 02:25:07,267 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-13 02:25:07,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:25:07,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:25:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 558418949, now seen corresponding path program 1 times [2024-10-13 02:25:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:25:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582108576] [2024-10-13 02:25:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:25:07,269 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-13 02:25:07,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:25:07,270 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-13 02:25:07,272 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-13 02:25:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:25:07,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 02:25:07,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:25:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1082 proven. 144 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2024-10-13 02:25:09,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:25:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-13 02:25:09,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:25:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582108576] [2024-10-13 02:25:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582108576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:25:09,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:25:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-13 02:25:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835890691] [2024-10-13 02:25:09,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:25:09,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 02:25:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:25:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 02:25:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:25:09,958 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-13 02:25:14,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:25:18,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:25:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:25:18,760 INFO L93 Difference]: Finished difference Result 328 states and 471 transitions. [2024-10-13 02:25:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:25:18,766 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 223 [2024-10-13 02:25:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:25:18,768 INFO L225 Difference]: With dead ends: 328 [2024-10-13 02:25:18,768 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 02:25:18,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-13 02:25:18,770 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 144 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:25:18,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 594 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-10-13 02:25:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 02:25:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2024-10-13 02:25:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 122 states have internal predecessors, (143), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 02:25:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2024-10-13 02:25:18,798 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 223 [2024-10-13 02:25:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:25:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2024-10-13 02:25:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-13 02:25:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2024-10-13 02:25:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 02:25:18,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:25:18,802 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:25:18,824 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 (6)] Ended with exit code 0 [2024-10-13 02:25:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-13 02:25:19,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:25:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:25:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 560265991, now seen corresponding path program 1 times [2024-10-13 02:25:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:25:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249141214] [2024-10-13 02:25:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:25:19,004 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-13 02:25:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:25:19,006 INFO L229 MonitoredProcess]: Starting monitored process 7 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-13 02:25:19,007 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 (7)] Waiting until timeout for monitored process [2024-10-13 02:25:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:25:19,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 02:25:19,617 INFO L278 TraceCheckSpWp]: Computing forward predicates...