./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:23:05,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:23:05,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:23:05,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:23:05,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:23:05,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:23:05,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:23:05,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:23:05,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:23:05,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:23:05,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:23:05,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:23:05,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:23:05,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:23:05,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:23:05,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:23:05,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:23:05,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:23:05,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:23:05,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:23:05,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:23:05,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:23:05,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:23:05,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:23:05,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:23:05,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:23:05,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:23:05,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:23:05,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:23:05,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:23:05,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:23:05,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:23:05,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:05,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:23:05,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:23:05,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:23:05,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:23:05,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:23:05,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:23:05,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:23:05,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:23:05,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:23:05,351 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2024-11-08 20:23:05,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:23:05,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:23:05,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:23:05,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:23:05,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:23:05,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:07,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:23:07,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:23:07,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:07,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9471dd8ad/5bb0d3609bb843beaaa7a1d8d88502b9/FLAGa9c0c867c [2024-11-08 20:23:07,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9471dd8ad/5bb0d3609bb843beaaa7a1d8d88502b9 [2024-11-08 20:23:07,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:23:07,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:23:07,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:07,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:23:07,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:23:07,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bab8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07, skipping insertion in model container [2024-11-08 20:23:07,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:23:07,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-11-08 20:23:07,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:07,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:23:07,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-11-08 20:23:07,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:07,839 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:23:07,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07 WrapperNode [2024-11-08 20:23:07,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:07,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:07,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:23:07,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:23:07,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,893 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-08 20:23:07,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:07,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:23:07,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:23:07,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:23:07,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,943 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-11-08 20:23:07,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:23:07,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:23:07,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:23:07,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:23:07,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (1/1) ... [2024-11-08 20:23:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:07,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:08,010 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-11-08 20:23:08,017 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-11-08 20:23:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:23:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:23:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:23:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:23:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:23:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:23:08,167 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:23:08,170 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:23:08,530 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 20:23:08,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:23:08,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:23:08,551 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:23:08,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:08 BoogieIcfgContainer [2024-11-08 20:23:08,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:23:08,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:23:08,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:23:08,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:23:08,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:23:07" (1/3) ... [2024-11-08 20:23:08,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2c04a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:08, skipping insertion in model container [2024-11-08 20:23:08,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:07" (2/3) ... [2024-11-08 20:23:08,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2c04a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:08, skipping insertion in model container [2024-11-08 20:23:08,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:08" (3/3) ... [2024-11-08 20:23:08,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:08,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:23:08,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:23:08,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:23:08,681 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;@2b5be705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:23:08,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:23:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:23:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:23:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:08,699 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:08,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:08,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 960380178, now seen corresponding path program 1 times [2024-11-08 20:23:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648128349] [2024-11-08 20:23:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648128349] [2024-11-08 20:23:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648128349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:09,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:23:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362748045] [2024-11-08 20:23:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:09,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:23:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:23:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:09,311 INFO L87 Difference]: Start difference. First operand has 80 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:09,352 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2024-11-08 20:23:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:23:09,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-11-08 20:23:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:09,365 INFO L225 Difference]: With dead ends: 153 [2024-11-08 20:23:09,366 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 20:23:09,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-11-08 20:23:09,376 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:09,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 20:23:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 20:23:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:23:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-08 20:23:09,440 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 176 [2024-11-08 20:23:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:09,443 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-08 20:23:09,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-08 20:23:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:23:09,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:09,448 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:09,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:23:09,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2138618710, now seen corresponding path program 1 times [2024-11-08 20:23:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564374890] [2024-11-08 20:23:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564374890] [2024-11-08 20:23:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564374890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:10,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85867368] [2024-11-08 20:23:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:23:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:23:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:23:10,056 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:10,125 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2024-11-08 20:23:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:23:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-08 20:23:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:10,129 INFO L225 Difference]: With dead ends: 166 [2024-11-08 20:23:10,129 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 20:23:10,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-11-08 20:23:10,133 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 18 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:10,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 20:23:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2024-11-08 20:23:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:23:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-08 20:23:10,157 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 176 [2024-11-08 20:23:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-08 20:23:10,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-08 20:23:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:23:10,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:10,166 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:10,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:23:10,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1394106993, now seen corresponding path program 1 times [2024-11-08 20:23:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616649394] [2024-11-08 20:23:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:10,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:10,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616649394] [2024-11-08 20:23:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616649394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:23:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196480426] [2024-11-08 20:23:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:10,779 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:10,899 INFO L93 Difference]: Finished difference Result 198 states and 292 transitions. [2024-11-08 20:23:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:10,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-08 20:23:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:10,903 INFO L225 Difference]: With dead ends: 198 [2024-11-08 20:23:10,903 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 20:23:10,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:10,906 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:10,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 322 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:23:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 20:23:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2024-11-08 20:23:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:23:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-11-08 20:23:10,931 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 177 [2024-11-08 20:23:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:10,933 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-11-08 20:23:10,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-11-08 20:23:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:23:10,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:10,939 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:10,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:23:10,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2091513677, now seen corresponding path program 1 times [2024-11-08 20:23:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647838285] [2024-11-08 20:23:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 20:23:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647838285] [2024-11-08 20:23:11,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647838285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:23:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999146973] [2024-11-08 20:23:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:11,365 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-11-08 20:23:11,367 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-11-08 20:23:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:11,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:23:11,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 20:23:11,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:23:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 20:23:12,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999146973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:23:12,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:23:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 20:23:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448152901] [2024-11-08 20:23:12,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:23:12,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:23:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:23:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:23:12,173 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 20:23:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:12,444 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-11-08 20:23:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:23:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 177 [2024-11-08 20:23:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:12,448 INFO L225 Difference]: With dead ends: 184 [2024-11-08 20:23:12,451 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 20:23:12,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:23:12,453 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:12,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 199 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:23:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 20:23:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-08 20:23:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:23:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-08 20:23:12,467 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 177 [2024-11-08 20:23:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-08 20:23:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 20:23:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-08 20:23:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:23:12,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:12,470 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:12,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:23:12,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:12,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1787134003, now seen corresponding path program 1 times [2024-11-08 20:23:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305781843] [2024-11-08 20:23:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:23:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761630418] [2024-11-08 20:23:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:12,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:12,794 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-11-08 20:23:12,795 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-11-08 20:23:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:12,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:23:12,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:13,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:13,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305781843] [2024-11-08 20:23:13,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 20:23:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761630418] [2024-11-08 20:23:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761630418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:13,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608582259] [2024-11-08 20:23:13,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:13,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:13,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:13,528 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:13,672 INFO L93 Difference]: Finished difference Result 259 states and 374 transitions. [2024-11-08 20:23:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:13,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-08 20:23:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:13,675 INFO L225 Difference]: With dead ends: 259 [2024-11-08 20:23:13,675 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 20:23:13,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 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-11-08 20:23:13,676 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:13,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 329 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:23:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 20:23:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2024-11-08 20:23:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:23:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-11-08 20:23:13,706 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 177 [2024-11-08 20:23:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:13,707 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-11-08 20:23:13,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-11-08 20:23:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:23:13,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:13,710 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:13,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:23:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:13,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -250864885, now seen corresponding path program 1 times [2024-11-08 20:23:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123916778] [2024-11-08 20:23:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123916778] [2024-11-08 20:23:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123916778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:14,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:23:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255083596] [2024-11-08 20:23:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:14,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:14,123 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:14,284 INFO L93 Difference]: Finished difference Result 314 states and 453 transitions. [2024-11-08 20:23:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-11-08 20:23:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:14,287 INFO L225 Difference]: With dead ends: 314 [2024-11-08 20:23:14,287 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 20:23:14,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-11-08 20:23:14,290 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 140 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:14,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 216 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:23:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 20:23:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 148. [2024-11-08 20:23:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:23:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-11-08 20:23:14,331 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 177 [2024-11-08 20:23:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:14,332 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-11-08 20:23:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-11-08 20:23:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:23:14,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:14,333 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:14,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:23:14,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:14,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1629396625, now seen corresponding path program 1 times [2024-11-08 20:23:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634559005] [2024-11-08 20:23:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:14,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634559005] [2024-11-08 20:23:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634559005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:23:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148564708] [2024-11-08 20:23:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:14,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:14,555 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:14,697 INFO L93 Difference]: Finished difference Result 314 states and 452 transitions. [2024-11-08 20:23:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:14,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-08 20:23:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:14,700 INFO L225 Difference]: With dead ends: 314 [2024-11-08 20:23:14,701 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 20:23:14,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-11-08 20:23:14,702 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 123 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:14,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 220 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:23:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 20:23:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 144. [2024-11-08 20:23:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.170731707317073) internal successors, (96), 82 states have internal predecessors, (96), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:23:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-08 20:23:14,733 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 178 [2024-11-08 20:23:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:14,737 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-08 20:23:14,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-08 20:23:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:23:14,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:14,739 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:23:14,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1841312890, now seen corresponding path program 1 times [2024-11-08 20:23:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175945665] [2024-11-08 20:23:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:23:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:23:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:23:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:23:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:23:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 20:23:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:23:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 20:23:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:23:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 20:23:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 20:23:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:23:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 20:23:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:23:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 20:23:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:23:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 20:23:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:23:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 20:23:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:23:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:23:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:23:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:23:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:23:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:23:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:23:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:23:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:23:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:23:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175945665] [2024-11-08 20:23:15,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175945665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:15,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:15,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:23:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279430550] [2024-11-08 20:23:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:15,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:23:15,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:15,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:15,045 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:15,199 INFO L93 Difference]: Finished difference Result 243 states and 348 transitions. [2024-11-08 20:23:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-08 20:23:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:15,202 INFO L225 Difference]: With dead ends: 243 [2024-11-08 20:23:15,202 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 20:23:15,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-11-08 20:23:15,203 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:15,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 321 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:23:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 20:23:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 145. [2024-11-08 20:23:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:23:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2024-11-08 20:23:15,224 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 178 [2024-11-08 20:23:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2024-11-08 20:23:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2024-11-08 20:23:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 20:23:15,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:15,227 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:15,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:23:15,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 586683570, now seen corresponding path program 1 times [2024-11-08 20:23:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:23:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233486582] [2024-11-08 20:23:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:23:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:23:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464453120] [2024-11-08 20:23:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:15,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:15,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:23:15,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:23:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:23:15,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:23:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:23:15,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:23:15,652 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:23:15,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:23:15,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 20:23:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:23:15,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:23:15,993 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:23:15,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:23:15 BoogieIcfgContainer [2024-11-08 20:23:15,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:23:15,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:23:15,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:23:15,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:23:15,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:08" (3/4) ... [2024-11-08 20:23:15,999 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:23:16,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:23:16,000 INFO L158 Benchmark]: Toolchain (without parser) took 8563.72ms. Allocated memory was 140.5MB in the beginning and 281.0MB in the end (delta: 140.5MB). Free memory was 87.4MB in the beginning and 111.5MB in the end (delta: -24.2MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,000 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory was 103.4MB in the beginning and 103.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:23:16,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.63ms. Allocated memory is still 140.5MB. Free memory was 86.9MB in the beginning and 71.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.56ms. Allocated memory is still 140.5MB. Free memory was 70.6MB in the beginning and 68.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,001 INFO L158 Benchmark]: Boogie Preprocessor took 73.88ms. Allocated memory is still 140.5MB. Free memory was 68.0MB in the beginning and 63.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,001 INFO L158 Benchmark]: RCFGBuilder took 577.52ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 63.8MB in the beginning and 153.3MB in the end (delta: -89.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,001 INFO L158 Benchmark]: TraceAbstraction took 7441.54ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 152.6MB in the beginning and 111.5MB in the end (delta: 41.0MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2024-11-08 20:23:16,002 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 281.0MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:23:16,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory was 103.4MB in the beginning and 103.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.63ms. Allocated memory is still 140.5MB. Free memory was 86.9MB in the beginning and 71.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.56ms. Allocated memory is still 140.5MB. Free memory was 70.6MB in the beginning and 68.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.88ms. Allocated memory is still 140.5MB. Free memory was 68.0MB in the beginning and 63.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 577.52ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 63.8MB in the beginning and 153.3MB in the end (delta: -89.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7441.54ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 152.6MB in the beginning and 111.5MB in the end (delta: 41.0MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 281.0MB. Free memory is still 111.5MB. 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 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 164. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_33 = 100; [L42] double var_1_34 = 63.5; [L43] double var_1_35 = 3.75; [L44] signed long int var_1_36 = -10; [L45] signed long int var_1_37 = 64; [L46] signed long int var_1_38 = 32; [L47] signed long int var_1_39 = -1000000; [L48] signed char var_1_40 = 8; [L49] signed char var_1_41 = -4; [L50] unsigned char var_1_42 = 25; [L51] unsigned char var_1_43 = 8; [L52] unsigned char last_1_var_1_17 = 1; [L53] double last_1_var_1_20 = 9.25; [L54] unsigned char last_1_var_1_23 = 2; [L55] unsigned short int last_1_var_1_26 = 5; [L56] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L168] isInitial = 1 [L169] FCALL initially() [L170] COND TRUE 1 [L171] CALL updateLastVariables() [L157] last_1_var_1_17 = var_1_17 [L158] last_1_var_1_20 = var_1_20 [L159] last_1_var_1_23 = var_1_23 [L160] last_1_var_1_26 = var_1_26 [L161] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L171] RET updateLastVariables() [L172] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L112] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L115] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L117] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L120] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L123] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L125] var_1_21 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L126] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L127] var_1_22 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L128] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L129] var_1_25 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L132] var_1_27 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L133] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L135] var_1_28 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L136] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L138] var_1_33 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L139] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L141] var_1_35 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L142] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L143] var_1_38 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_38 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L144] RET assume_abort_if_not(var_1_38 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L146] var_1_39 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_39 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L147] RET assume_abort_if_not(var_1_39 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] CALL assume_abort_if_not(var_1_39 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] RET assume_abort_if_not(var_1_39 <= 2147483646) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L149] var_1_41 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L150] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L152] var_1_43 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L153] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L154] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L154] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L172] RET updateVariables() [L173] CALL step() [L60] var_1_32 = var_1_33 [L61] var_1_34 = var_1_35 [L62] var_1_36 = -256 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] EXPR ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] COND TRUE var_1_36 >= (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32) [L64] var_1_37 = var_1_39 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L66] var_1_40 = var_1_41 [L67] var_1_42 = var_1_43 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L68] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L71] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L72] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L73] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L81] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L82] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L84] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L85] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L88] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L89] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L90] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L97] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L98] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L105] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L107] var_1_31 = var_1_26 [L108] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L173] RET step() [L174] CALL, EXPR property() [L164-L165] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L174] RET, EXPR property() [L174] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 1937 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1019 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 918 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 961 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 250 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2128 NumberOfCodeBlocks, 2128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1760 ConstructedInterpolants, 0 QuantifiedInterpolants, 4143 SizeOfPredicates, 2 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 14922/15120 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-11-08 20:23:16,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:23:18,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:23:18,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:23:18,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:23:18,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:23:18,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:23:18,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:23:18,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:23:18,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:23:18,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:23:18,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:23:18,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:23:18,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:23:18,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:23:18,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:23:18,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:23:18,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:23:18,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:23:18,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:23:18,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:23:18,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:23:18,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:23:18,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:23:18,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:23:18,520 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:23:18,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:23:18,521 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:23:18,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:23:18,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:23:18,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:23:18,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:23:18,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:23:18,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:23:18,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:23:18,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:18,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:23:18,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:23:18,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:23:18,526 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:23:18,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:23:18,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:23:18,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:23:18,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:23:18,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:23:18,528 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2024-11-08 20:23:18,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:23:18,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:23:18,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:23:18,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:23:18,899 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:23:18,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:20,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:23:20,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:23:20,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:20,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9012b5111/7322d576f99443b7b29b74f240efa14c/FLAG9eca52c47 [2024-11-08 20:23:21,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9012b5111/7322d576f99443b7b29b74f240efa14c [2024-11-08 20:23:21,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:23:21,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:23:21,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:21,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:23:21,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:23:21,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49dda69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21, skipping insertion in model container [2024-11-08 20:23:21,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:23:21,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-11-08 20:23:21,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:21,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:23:21,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-11-08 20:23:21,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:23:21,508 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:23:21,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21 WrapperNode [2024-11-08 20:23:21,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:23:21,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:21,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:23:21,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:23:21,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,571 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 20:23:21,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:23:21,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:23:21,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:23:21,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:23:21,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,624 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-11-08 20:23:21,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:23:21,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:23:21,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:23:21,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:23:21,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (1/1) ... [2024-11-08 20:23:21,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:23:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:23:21,694 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-11-08 20:23:21,697 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-11-08 20:23:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:23:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:23:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:23:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:23:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:23:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:23:21,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:23:21,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:23:28,365 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 20:23:28,366 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:23:28,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:23:28,383 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:23:28,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:28 BoogieIcfgContainer [2024-11-08 20:23:28,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:23:28,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:23:28,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:23:28,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:23:28,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:23:21" (1/3) ... [2024-11-08 20:23:28,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fbd64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:28, skipping insertion in model container [2024-11-08 20:23:28,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:23:21" (2/3) ... [2024-11-08 20:23:28,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fbd64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:23:28, skipping insertion in model container [2024-11-08 20:23:28,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:23:28" (3/3) ... [2024-11-08 20:23:28,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-11-08 20:23:28,407 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:23:28,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:23:28,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:23:28,472 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;@46b92ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:23:28,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:23:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:23:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 20:23:28,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:28,497 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:28,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:28,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1350475355, now seen corresponding path program 1 times [2024-11-08 20:23:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814475656] [2024-11-08 20:23:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:28,522 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-11-08 20:23:28,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:28,526 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-11-08 20:23:28,528 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-11-08 20:23:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:23:29,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-08 20:23:29,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:29,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:23:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814475656] [2024-11-08 20:23:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814475656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:23:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126905990] [2024-11-08 20:23:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:29,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:23:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:23:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:23:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:23:29,165 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:29,201 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2024-11-08 20:23:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:23:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-08 20:23:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:29,211 INFO L225 Difference]: With dead ends: 147 [2024-11-08 20:23:29,211 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 20:23:29,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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-11-08 20:23:29,220 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:29,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:23:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 20:23:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 20:23:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:23:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-08 20:23:29,271 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 175 [2024-11-08 20:23:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-08 20:23:29,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:23:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-08 20:23:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 20:23:29,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:29,275 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:29,289 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-11-08 20:23:29,476 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-11-08 20:23:29,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:29,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1003602088, now seen corresponding path program 1 times [2024-11-08 20:23:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:29,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048541912] [2024-11-08 20:23:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:29,479 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-11-08 20:23:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:29,482 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-11-08 20:23:29,505 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-11-08 20:23:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:29,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 20:23:29,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:34,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:34,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:23:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048541912] [2024-11-08 20:23:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048541912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752170337] [2024-11-08 20:23:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:34,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:23:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:34,139 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:38,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:23:42,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:23:46,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:23:50,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:23:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:23:50,888 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2024-11-08 20:23:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:23:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-08 20:23:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:23:50,931 INFO L225 Difference]: With dead ends: 222 [2024-11-08 20:23:50,931 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 20:23:50,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:23:50,933 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 57 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:23:50,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2024-11-08 20:23:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 20:23:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2024-11-08 20:23:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:23:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2024-11-08 20:23:50,992 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 176 [2024-11-08 20:23:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:23:50,993 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2024-11-08 20:23:50,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2024-11-08 20:23:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 20:23:50,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:23:50,998 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:23:51,019 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:23:51,198 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-11-08 20:23:51,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:23:51,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:23:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 360998467, now seen corresponding path program 1 times [2024-11-08 20:23:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:23:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464771623] [2024-11-08 20:23:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:23:51,200 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-11-08 20:23:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:23:51,203 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-11-08 20:23:51,204 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-11-08 20:23:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:23:51,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:23:51,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:23:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:23:53,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:23:53,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:23:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464771623] [2024-11-08 20:23:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464771623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:23:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:23:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:23:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919801050] [2024-11-08 20:23:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:23:53,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:23:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:23:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:23:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:23:53,702 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:23:57,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:24:02,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:24:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:24:02,152 INFO L93 Difference]: Finished difference Result 214 states and 321 transitions. [2024-11-08 20:24:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:24:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-08 20:24:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:24:02,198 INFO L225 Difference]: With dead ends: 214 [2024-11-08 20:24:02,198 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 20:24:02,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:24:02,201 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:24:02,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2024-11-08 20:24:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 20:24:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2024-11-08 20:24:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 states have internal predecessors, (79), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:24:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2024-11-08 20:24:02,246 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 177 [2024-11-08 20:24:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:24:02,247 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2024-11-08 20:24:02,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:24:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-11-08 20:24:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:24:02,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:24:02,250 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 20:24:02,271 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-11-08 20:24:02,451 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-11-08 20:24:02,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:24:02,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:24:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1354770687, now seen corresponding path program 1 times [2024-11-08 20:24:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:24:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278045643] [2024-11-08 20:24:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:24:02,453 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-11-08 20:24:02,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:24:02,459 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-11-08 20:24:02,460 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-11-08 20:24:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:24:02,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 20:24:02,944 INFO L278 TraceCheckSpWp]: Computing forward predicates...