./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.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-50_file-11.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 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:55:33,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:55:33,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:55:33,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:55:33,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:55:33,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:55:33,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:55:33,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:55:33,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:55:33,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:55:33,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:55:33,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:55:33,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:55:33,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:55:33,820 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:55:33,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:55:33,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:55:33,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:55:33,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:55:33,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:55:33,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:55:33,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:55:33,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:55:33,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:55:33,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:55:33,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:55:33,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:55:33,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:55:33,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:55:33,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:55:33,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:55:33,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:55:33,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:55:33,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:55:33,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:55:33,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:55:33,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:55:33,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:55:33,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:55:33,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:55:33,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:55:33,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:55:33,826 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 -> 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb [2024-11-08 20:55:34,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:55:34,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:55:34,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:55:34,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:55:34,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:55:34,075 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-50_file-11.i [2024-11-08 20:55:35,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:55:35,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:55:35,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-11-08 20:55:35,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed928a43/20171c022b924a9b939f055035ef5855/FLAGd25aed3e8 [2024-11-08 20:55:36,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed928a43/20171c022b924a9b939f055035ef5855 [2024-11-08 20:55:36,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:55:36,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:55:36,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:55:36,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:55:36,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:55:36,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3672c7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36, skipping insertion in model container [2024-11-08 20:55:36,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:55:36,307 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-50_file-11.i[915,928] [2024-11-08 20:55:36,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:55:36,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:55:36,434 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-50_file-11.i[915,928] [2024-11-08 20:55:36,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:55:36,496 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:55:36,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36 WrapperNode [2024-11-08 20:55:36,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:55:36,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:55:36,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:55:36,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:55:36,512 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:55:36" (1/1) ... [2024-11-08 20:55:36,527 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:55:36" (1/1) ... [2024-11-08 20:55:36,577 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-08 20:55:36,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:55:36,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:55:36,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:55:36,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:55:36,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,654 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:55:36,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:55:36,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:55:36,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:55:36,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:55:36,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (1/1) ... [2024-11-08 20:55:36,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:55:36,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:55:36,728 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:55:36,737 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:55:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:55:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:55:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:55:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:55:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:55:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:55:36,846 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:55:36,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:55:37,149 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 20:55:37,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:55:37,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:55:37,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:55:37,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:55:37 BoogieIcfgContainer [2024-11-08 20:55:37,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:55:37,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:55:37,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:55:37,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:55:37,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:55:36" (1/3) ... [2024-11-08 20:55:37,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f101283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:55:37, skipping insertion in model container [2024-11-08 20:55:37,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:36" (2/3) ... [2024-11-08 20:55:37,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f101283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:55:37, skipping insertion in model container [2024-11-08 20:55:37,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:55:37" (3/3) ... [2024-11-08 20:55:37,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-11-08 20:55:37,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:55:37,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:55:37,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:55:37,238 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;@4085c543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:55:37,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:55:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:55:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:55:37,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:37,263 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:37,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1204178717, now seen corresponding path program 1 times [2024-11-08 20:55:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:37,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005927953] [2024-11-08 20:55:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005927953] [2024-11-08 20:55:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005927953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:55:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801366206] [2024-11-08 20:55:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:38,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:55:38,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:55:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:55:38,060 INFO L87 Difference]: Start difference. First operand has 103 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:55:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:38,091 INFO L93 Difference]: Finished difference Result 199 states and 355 transitions. [2024-11-08 20:55:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:55:38,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-08 20:55:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:38,101 INFO L225 Difference]: With dead ends: 199 [2024-11-08 20:55:38,101 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 20:55:38,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:55:38,109 INFO L432 NwaCegarLoop]: 156 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, 156 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:55:38,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:55:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 20:55:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 20:55:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:55:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2024-11-08 20:55:38,163 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 207 [2024-11-08 20:55:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:38,164 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2024-11-08 20:55:38,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:55:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2024-11-08 20:55:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:55:38,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:38,168 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:55:38,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -547545499, now seen corresponding path program 1 times [2024-11-08 20:55:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372929885] [2024-11-08 20:55:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372929885] [2024-11-08 20:55:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372929885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:55:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683668862] [2024-11-08 20:55:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:38,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:38,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:38,611 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:38,793 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2024-11-08 20:55:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-11-08 20:55:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:38,800 INFO L225 Difference]: With dead ends: 257 [2024-11-08 20:55:38,801 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 20:55:38,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:38,803 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 94 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:38,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 581 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:55:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 20:55:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-08 20:55:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 20:55:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 250 transitions. [2024-11-08 20:55:38,840 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 250 transitions. Word has length 207 [2024-11-08 20:55:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:38,841 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 250 transitions. [2024-11-08 20:55:38,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 250 transitions. [2024-11-08 20:55:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 20:55:38,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:38,844 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:55:38,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:38,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash -249461193, now seen corresponding path program 1 times [2024-11-08 20:55:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495868643] [2024-11-08 20:55:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495868643] [2024-11-08 20:55:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495868643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:39,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:55:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713073323] [2024-11-08 20:55:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:39,332 INFO L87 Difference]: Start difference. First operand 158 states and 250 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:39,645 INFO L93 Difference]: Finished difference Result 530 states and 838 transitions. [2024-11-08 20:55:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-08 20:55:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:39,651 INFO L225 Difference]: With dead ends: 530 [2024-11-08 20:55:39,651 INFO L226 Difference]: Without dead ends: 375 [2024-11-08 20:55:39,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:55:39,653 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 186 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:39,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 715 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:55:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-08 20:55:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2024-11-08 20:55:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 235 states have internal predecessors, (321), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 587 transitions. [2024-11-08 20:55:39,696 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 587 transitions. Word has length 208 [2024-11-08 20:55:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:39,697 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 587 transitions. [2024-11-08 20:55:39,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 587 transitions. [2024-11-08 20:55:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:55:39,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:39,700 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:55:39,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash 307871498, now seen corresponding path program 1 times [2024-11-08 20:55:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342424759] [2024-11-08 20:55:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342424759] [2024-11-08 20:55:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342424759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:39,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:55:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441521312] [2024-11-08 20:55:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:39,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:55:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:55:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:55:39,906 INFO L87 Difference]: Start difference. First operand 372 states and 587 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:40,115 INFO L93 Difference]: Finished difference Result 655 states and 1036 transitions. [2024-11-08 20:55:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:55:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:55:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:40,123 INFO L225 Difference]: With dead ends: 655 [2024-11-08 20:55:40,123 INFO L226 Difference]: Without dead ends: 500 [2024-11-08 20:55:40,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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:55:40,124 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 110 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:40,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 468 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:55:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-08 20:55:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 383. [2024-11-08 20:55:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 243 states have (on average 1.3950617283950617) internal successors, (339), 246 states have internal predecessors, (339), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2024-11-08 20:55:40,159 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 209 [2024-11-08 20:55:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:40,159 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2024-11-08 20:55:40,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2024-11-08 20:55:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:55:40,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:40,161 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:55:40,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1641301356, now seen corresponding path program 1 times [2024-11-08 20:55:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249850690] [2024-11-08 20:55:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249850690] [2024-11-08 20:55:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249850690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:40,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:55:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014727460] [2024-11-08 20:55:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:40,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:40,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:40,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:40,322 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:40,452 INFO L93 Difference]: Finished difference Result 866 states and 1371 transitions. [2024-11-08 20:55:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:55:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:40,456 INFO L225 Difference]: With dead ends: 866 [2024-11-08 20:55:40,456 INFO L226 Difference]: Without dead ends: 546 [2024-11-08 20:55:40,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:40,458 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 93 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:40,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 587 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:55:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-08 20:55:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 371. [2024-11-08 20:55:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 234 states have internal predecessors, (317), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 583 transitions. [2024-11-08 20:55:40,507 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 583 transitions. Word has length 209 [2024-11-08 20:55:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:40,508 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 583 transitions. [2024-11-08 20:55:40,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 583 transitions. [2024-11-08 20:55:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:55:40,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:40,510 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:55:40,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:40,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -736835990, now seen corresponding path program 1 times [2024-11-08 20:55:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623596487] [2024-11-08 20:55:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:41,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623596487] [2024-11-08 20:55:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623596487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:41,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:55:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092089759] [2024-11-08 20:55:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:41,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:41,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:41,020 INFO L87 Difference]: Start difference. First operand 371 states and 583 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:41,065 INFO L93 Difference]: Finished difference Result 721 states and 1129 transitions. [2024-11-08 20:55:41,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:55:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:41,068 INFO L225 Difference]: With dead ends: 721 [2024-11-08 20:55:41,068 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 20:55:41,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:41,069 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 32 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:41,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 433 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:55:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 20:55:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 387. [2024-11-08 20:55:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 250 states have internal predecessors, (341), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 607 transitions. [2024-11-08 20:55:41,099 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 607 transitions. Word has length 209 [2024-11-08 20:55:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:41,100 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 607 transitions. [2024-11-08 20:55:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 607 transitions. [2024-11-08 20:55:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:55:41,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:41,102 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:55:41,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -734988948, now seen corresponding path program 1 times [2024-11-08 20:55:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832076895] [2024-11-08 20:55:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832076895] [2024-11-08 20:55:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832076895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:55:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372648460] [2024-11-08 20:55:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:41,520 INFO L87 Difference]: Start difference. First operand 387 states and 607 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:41,738 INFO L93 Difference]: Finished difference Result 827 states and 1305 transitions. [2024-11-08 20:55:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:41,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-08 20:55:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:41,742 INFO L225 Difference]: With dead ends: 827 [2024-11-08 20:55:41,742 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 20:55:41,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:55:41,743 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 123 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:41,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 528 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:55:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 20:55:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 441. [2024-11-08 20:55:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 301 states have (on average 1.4252491694352158) internal successors, (429), 303 states have internal predecessors, (429), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 695 transitions. [2024-11-08 20:55:41,779 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 695 transitions. Word has length 209 [2024-11-08 20:55:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 695 transitions. [2024-11-08 20:55:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 695 transitions. [2024-11-08 20:55:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 20:55:41,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:41,782 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:55:41,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash 100827096, now seen corresponding path program 1 times [2024-11-08 20:55:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660500253] [2024-11-08 20:55:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:55:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:55:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:55:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:55:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:55:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:55:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:55:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:55:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:55:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:55:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:55:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:55:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:55:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:55:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:55:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:55:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:55:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:55:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:55:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:55:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:55:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:55:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:55:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:55:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:55:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:55:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:55:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:55:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:55:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:55:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:55:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:55:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:55:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:55:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:55:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660500253] [2024-11-08 20:55:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660500253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:55:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131354474] [2024-11-08 20:55:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:55:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:55:42,264 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:55:42,265 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:55:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:42,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 20:55:42,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:55:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-08 20:55:42,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:55:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:55:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131354474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:55:43,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:55:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 20:55:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212914596] [2024-11-08 20:55:43,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:55:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:55:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:55:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:55:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 20:55:43,008 INFO L87 Difference]: Start difference. First operand 441 states and 695 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:55:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:43,262 INFO L93 Difference]: Finished difference Result 791 states and 1221 transitions. [2024-11-08 20:55:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:55:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 210 [2024-11-08 20:55:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:43,266 INFO L225 Difference]: With dead ends: 791 [2024-11-08 20:55:43,266 INFO L226 Difference]: Without dead ends: 467 [2024-11-08 20:55:43,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:55:43,267 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 267 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:43,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 277 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:55:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-08 20:55:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 445. [2024-11-08 20:55:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 300 states have (on average 1.3733333333333333) internal successors, (412), 302 states have internal predecessors, (412), 133 states have call successors, (133), 11 states have call predecessors, (133), 11 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-08 20:55:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 678 transitions. [2024-11-08 20:55:43,305 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 678 transitions. Word has length 210 [2024-11-08 20:55:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 678 transitions. [2024-11-08 20:55:43,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:55:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 678 transitions. [2024-11-08 20:55:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 20:55:43,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:43,307 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:55:43,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:55:43,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:43,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash -494039739, now seen corresponding path program 1 times [2024-11-08 20:55:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:55:43,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884916799] [2024-11-08 20:55:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:55:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:55:43,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:55:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:55:43,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:55:43,780 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:55:43,781 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:55:43,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:55:43,784 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:55:43,880 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:55:43,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:55:43 BoogieIcfgContainer [2024-11-08 20:55:43,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:55:43,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:55:43,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:55:43,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:55:43,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:55:37" (3/4) ... [2024-11-08 20:55:43,885 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:55:43,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:55:43,886 INFO L158 Benchmark]: Toolchain (without parser) took 7874.55ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 116.4MB in the beginning and 102.5MB in the end (delta: 13.9MB). Peak memory consumption was 170.5MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,887 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:55:43,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.02ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 99.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.15ms. Allocated memory is still 172.0MB. Free memory was 99.2MB in the beginning and 96.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,887 INFO L158 Benchmark]: Boogie Preprocessor took 117.16ms. Allocated memory is still 172.0MB. Free memory was 96.3MB in the beginning and 93.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,887 INFO L158 Benchmark]: RCFGBuilder took 466.24ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 66.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,888 INFO L158 Benchmark]: TraceAbstraction took 6719.15ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 66.1MB in the beginning and 102.5MB in the end (delta: -36.4MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2024-11-08 20:55:43,888 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 327.2MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:55:43,889 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.16ms. Allocated memory is still 172.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.02ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 99.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.15ms. Allocated memory is still 172.0MB. Free memory was 99.2MB in the beginning and 96.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.16ms. Allocated memory is still 172.0MB. Free memory was 96.3MB in the beginning and 93.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 466.24ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 66.9MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6719.15ms. Allocated memory was 172.0MB in the beginning and 327.2MB in the end (delta: 155.2MB). Free memory was 66.1MB in the beginning and 102.5MB in the end (delta: -36.4MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 327.2MB. Free memory is still 102.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 76, overapproximation of shiftRight at line 68, overapproximation of someUnaryDOUBLEoperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] signed char var_1_24 = -128; [L42] unsigned char var_1_25 = 10; [L43] signed char var_1_26 = 10; [L44] unsigned char var_1_27 = 128; [L45] unsigned char var_1_28 = 100; [L46] unsigned char var_1_29 = 1; [L47] float var_1_30 = 31.3; [L48] float var_1_31 = 1.5; [L49] float var_1_32 = 15.25; [L50] double var_1_33 = 128.8; [L51] signed char var_1_34 = 4; [L52] signed char var_1_35 = 1; [L53] unsigned char var_1_36 = 16; [L54] unsigned long int last_1_var_1_10 = 128; [L55] unsigned long int last_1_var_1_16 = 1; [L56] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] var_1_3 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L151] var_1_7 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L154] var_1_8 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L157] var_1_9 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] var_1_11 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] var_1_17 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L164] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L166] var_1_18 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_24 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not(var_1_24 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L174] var_1_26 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L175] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L177] var_1_27 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L178] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L181] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L186] var_1_31 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L187] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L188] var_1_32 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L190] var_1_34 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L193] var_1_35 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L194] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L211] RET updateVariables() [L212] CALL step() [L60] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L61] COND FALSE !(var_1_22 > var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR var_1_26 >> var_1_23 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR ((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] COND FALSE !(var_1_24 <= ((((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23))))) [L71] COND TRUE \read(var_1_29) [L72] var_1_25 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L75] COND TRUE \read(var_1_29) [L76] var_1_30 = ((((var_1_31) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_31) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L78] COND FALSE !(var_1_26 >= var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L91] COND FALSE !(var_1_27 >= (var_1_28 + var_1_22)) [L100] var_1_36 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] unsigned long int stepLocal_1 = last_1_var_1_16; [L103] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L113] COND TRUE var_1_12 == var_1_12 [L114] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L116] var_1_1 = (var_1_2 || (! var_1_3)) [L117] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L118] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L119] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L120] COND FALSE !(var_1_19 >= var_1_19) [L125] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L130] COND TRUE var_1_19 != var_1_19 [L131] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L139] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L140] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L141] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-4611686011984936961, var_1_18=-4611686011984936961, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=3609236775, var_1_31=3609236775, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 938 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 3745 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2324 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 1421 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 990 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 408 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2089 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2078 ConstructedInterpolants, 0 QuantifiedInterpolants, 4077 SizeOfPredicates, 3 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 20859/21120 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:55:43,933 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-50_file-11.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 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:55:46,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:55:46,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:55:46,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:55:46,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:55:46,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:55:46,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:55:46,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:55:46,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:55:46,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:55:46,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:55:46,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:55:46,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:55:46,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:55:46,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:55:46,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:55:46,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:55:46,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:55:46,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:55:46,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:55:46,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:55:46,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:55:46,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:55:46,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:55:46,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:55:46,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:55:46,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:55:46,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:55:46,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:55:46,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:55:46,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:55:46,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:55:46,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:55:46,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:55:46,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:55:46,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:55:46,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:55:46,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:55:46,315 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:55:46,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:55:46,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:55:46,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:55:46,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:55:46,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:55:46,318 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 -> 85203f26a83ad69778292af9e7fa30addf5d4520d3d2767587ebe1fd49fdeceb [2024-11-08 20:55:46,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:55:46,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:55:46,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:55:46,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:55:46,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:55:46,633 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-50_file-11.i [2024-11-08 20:55:48,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:55:48,344 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:55:48,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-11-08 20:55:48,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3706143/8eb46ad03db249fea240b2d94d78c2cf/FLAG460ab1d55 [2024-11-08 20:55:48,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3706143/8eb46ad03db249fea240b2d94d78c2cf [2024-11-08 20:55:48,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:55:48,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:55:48,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:55:48,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:55:48,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:55:48,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294256e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48, skipping insertion in model container [2024-11-08 20:55:48,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:55:48,559 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-50_file-11.i[915,928] [2024-11-08 20:55:48,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:55:48,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:55:48,657 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-50_file-11.i[915,928] [2024-11-08 20:55:48,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:55:48,714 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:55:48,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48 WrapperNode [2024-11-08 20:55:48,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:55:48,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:55:48,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:55:48,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:55:48,721 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:55:48" (1/1) ... [2024-11-08 20:55:48,737 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:55:48" (1/1) ... [2024-11-08 20:55:48,765 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-08 20:55:48,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:55:48,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:55:48,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:55:48,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:55:48,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,802 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:55:48,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:55:48,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:55:48,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:55:48,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:55:48,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (1/1) ... [2024-11-08 20:55:48,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:55:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:55:48,872 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:55:48,882 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:55:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:55:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:55:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:55:48,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:55:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:55:48,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:55:48,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:55:48,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:55:51,997 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:55:51,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:55:52,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:55:52,008 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:55:52,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:55:52 BoogieIcfgContainer [2024-11-08 20:55:52,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:55:52,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:55:52,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:55:52,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:55:52,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:55:48" (1/3) ... [2024-11-08 20:55:52,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6326818a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:55:52, skipping insertion in model container [2024-11-08 20:55:52,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:55:48" (2/3) ... [2024-11-08 20:55:52,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6326818a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:55:52, skipping insertion in model container [2024-11-08 20:55:52,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:55:52" (3/3) ... [2024-11-08 20:55:52,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-11.i [2024-11-08 20:55:52,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:55:52,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:55:52,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:55:52,073 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;@6f454413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:55:52,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:55:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:55:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 20:55:52,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:52,089 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:52,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:52,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1728159646, now seen corresponding path program 1 times [2024-11-08 20:55:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:55:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586475699] [2024-11-08 20:55:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:52,106 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:55:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:55:52,109 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:55:52,110 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:55:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:52,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:55:52,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:55:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-08 20:55:52,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:55:52,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:55:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586475699] [2024-11-08 20:55:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586475699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:55:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106220096] [2024-11-08 20:55:52,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:52,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:55:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:55:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:55:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:55:52,454 INFO L87 Difference]: Start difference. First operand has 95 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:55:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:52,483 INFO L93 Difference]: Finished difference Result 183 states and 331 transitions. [2024-11-08 20:55:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:55:52,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-11-08 20:55:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:52,497 INFO L225 Difference]: With dead ends: 183 [2024-11-08 20:55:52,497 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 20:55:52,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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:55:52,506 INFO L432 NwaCegarLoop]: 143 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, 143 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:55:52,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:55:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 20:55:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 20:55:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 20:55:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2024-11-08 20:55:52,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 205 [2024-11-08 20:55:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:52,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2024-11-08 20:55:52,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 20:55:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2024-11-08 20:55:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 20:55:52,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:52,553 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,561 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:55:52,757 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:55:52,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:52,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1020026014, now seen corresponding path program 1 times [2024-11-08 20:55:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:55:52,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286498328] [2024-11-08 20:55:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:52,760 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:55:52,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:55:52,761 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:55:52,762 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:55:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:53,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:55:53,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:55:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:54,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:55:54,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:55:54,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286498328] [2024-11-08 20:55:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286498328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:55:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036601305] [2024-11-08 20:55:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:54,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:55:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:55:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:55:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:55:54,244 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:55,180 INFO L93 Difference]: Finished difference Result 268 states and 424 transitions. [2024-11-08 20:55:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:55:55,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-11-08 20:55:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:55,187 INFO L225 Difference]: With dead ends: 268 [2024-11-08 20:55:55,187 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 20:55:55,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:55:55,190 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 100 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:55,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 476 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 20:55:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 20:55:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-11-08 20:55:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:55:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 257 transitions. [2024-11-08 20:55:55,225 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 257 transitions. Word has length 205 [2024-11-08 20:55:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:55,226 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 257 transitions. [2024-11-08 20:55:55,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 257 transitions. [2024-11-08 20:55:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 20:55:55,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:55,231 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 20:55:55,431 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:55:55,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:55,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -89976126, now seen corresponding path program 1 times [2024-11-08 20:55:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:55:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496419410] [2024-11-08 20:55:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:55,435 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:55:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:55:55,438 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:55:55,439 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:55:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:55,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 20:55:55,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:55:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-08 20:55:56,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:55:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-08 20:55:56,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:55:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496419410] [2024-11-08 20:55:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496419410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:55:56,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:55:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 20:55:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991797859] [2024-11-08 20:55:56,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:55:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:55:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:55:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:55:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:55:56,361 INFO L87 Difference]: Start difference. First operand 162 states and 257 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:55:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:55:56,752 INFO L93 Difference]: Finished difference Result 266 states and 411 transitions. [2024-11-08 20:55:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:55:56,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 206 [2024-11-08 20:55:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:55:56,756 INFO L225 Difference]: With dead ends: 266 [2024-11-08 20:55:56,756 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 20:55:56,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:55:56,757 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 173 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:55:56,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 236 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:55:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 20:55:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2024-11-08 20:55:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:55:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 261 transitions. [2024-11-08 20:55:56,778 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 261 transitions. Word has length 206 [2024-11-08 20:55:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:55:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 261 transitions. [2024-11-08 20:55:56,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-08 20:55:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 261 transitions. [2024-11-08 20:55:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 20:55:56,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:55:56,781 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:55:56,985 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:55:56,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:55:56,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:55:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2056714051, now seen corresponding path program 1 times [2024-11-08 20:55:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:55:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853617578] [2024-11-08 20:55:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:55:56,987 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:55:56,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:55:56,992 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:55:56,994 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:55:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:55:57,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:55:57,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:55:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-08 20:55:57,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:55:57,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:55:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853617578] [2024-11-08 20:55:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853617578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:55:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:55:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:55:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180679768] [2024-11-08 20:55:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:55:57,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:55:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:55:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:55:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:55:57,726 INFO L87 Difference]: Start difference. First operand 170 states and 261 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:55:59,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:56:00,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:56:02,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:56:03,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:56:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:56:03,973 INFO L93 Difference]: Finished difference Result 266 states and 408 transitions. [2024-11-08 20:56:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:56:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-11-08 20:56:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:56:03,978 INFO L225 Difference]: With dead ends: 266 [2024-11-08 20:56:03,979 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 20:56:03,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 204 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:56:03,980 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 106 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:56:03,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 334 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 20:56:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 20:56:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2024-11-08 20:56:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 20:56:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2024-11-08 20:56:04,021 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 207 [2024-11-08 20:56:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:56:04,022 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2024-11-08 20:56:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-08 20:56:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2024-11-08 20:56:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 20:56:04,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:56:04,026 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 20:56:04,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:56:04,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:56:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:56:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -468943044, now seen corresponding path program 1 times [2024-11-08 20:56:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:56:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79534100] [2024-11-08 20:56:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:56:04,233 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:56:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:56:04,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:56:04,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 20:56:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:56:04,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 20:56:04,401 INFO L278 TraceCheckSpWp]: Computing forward predicates...