./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-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 f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:21:12,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:21:13,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:21:13,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:21:13,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:21:13,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:21:13,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:21:13,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:21:13,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:21:13,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:21:13,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:21:13,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:21:13,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:21:13,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:21:13,101 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:21:13,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:21:13,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:21:13,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:21:13,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:21:13,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:21:13,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:21:13,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:21:13,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:21:13,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:21:13,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:21:13,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:21:13,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:21:13,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:21:13,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:21:13,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:21:13,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:21:13,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:21:13,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:13,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:21:13,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:21:13,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:21:13,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:21:13,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:21:13,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:21:13,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:21:13,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:21:13,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:21:13,113 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 -> f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e [2024-10-24 06:21:13,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:21:13,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:21:13,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:21:13,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:21:13,454 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:21:13,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:15,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:21:15,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:21:15,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:15,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda71c29a/e690f9c5283e40a7a00d5420977f7ffc/FLAGc077e1fe6 [2024-10-24 06:21:15,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda71c29a/e690f9c5283e40a7a00d5420977f7ffc [2024-10-24 06:21:15,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:21:15,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:21:15,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:15,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:21:15,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:21:15,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:15" (1/1) ... [2024-10-24 06:21:15,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2208405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:15, skipping insertion in model container [2024-10-24 06:21:15,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:15" (1/1) ... [2024-10-24 06:21:15,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:21:16,120 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i[915,928] [2024-10-24 06:21:16,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:16,305 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:21:16,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i[915,928] [2024-10-24 06:21:16,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:16,458 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:21:16,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16 WrapperNode [2024-10-24 06:21:16,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:16,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:16,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:21:16,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:21:16,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,551 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-24 06:21:16,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:16,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:21:16,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:21:16,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:21:16,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:21:16,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:21:16,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:21:16,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:21:16,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:21:16,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (1/1) ... [2024-10-24 06:21:16,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:16,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:21:16,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:21:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:21:16,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:21:16,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:21:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:21:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:21:16,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:21:17,007 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:21:17,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:21:17,467 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:21:17,469 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:21:17,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:21:17,527 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:21:17,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:17 BoogieIcfgContainer [2024-10-24 06:21:17,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:21:17,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:21:17,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:21:17,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:21:17,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:21:15" (1/3) ... [2024-10-24 06:21:17,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fceb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:17, skipping insertion in model container [2024-10-24 06:21:17,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:16" (2/3) ... [2024-10-24 06:21:17,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fceb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:17, skipping insertion in model container [2024-10-24 06:21:17,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:17" (3/3) ... [2024-10-24 06:21:17,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:17,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:21:17,553 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:21:17,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:21:17,628 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;@51a49b24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:21:17,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:21:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.5) internal successors, (66), 45 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 06:21:17,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:17,651 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:17,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:17,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1907298635, now seen corresponding path program 1 times [2024-10-24 06:21:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625079549] [2024-10-24 06:21:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:18,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625079549] [2024-10-24 06:21:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625079549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:18,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:21:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577476482] [2024-10-24 06:21:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:18,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:21:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:21:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:18,164 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.5) internal successors, (66), 45 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:21:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:18,205 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2024-10-24 06:21:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:21:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-10-24 06:21:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:18,224 INFO L225 Difference]: With dead ends: 139 [2024-10-24 06:21:18,226 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 06:21:18,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:18,233 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:18,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:21:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 06:21:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 06:21:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2024-10-24 06:21:18,281 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 150 [2024-10-24 06:21:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2024-10-24 06:21:18,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:21:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2024-10-24 06:21:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 06:21:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:18,285 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:18,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:21:18,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 881096207, now seen corresponding path program 1 times [2024-10-24 06:21:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073309697] [2024-10-24 06:21:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073309697] [2024-10-24 06:21:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073309697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:21:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731721792] [2024-10-24 06:21:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:18,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:21:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:21:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:18,671 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:18,732 INFO L93 Difference]: Finished difference Result 180 states and 281 transitions. [2024-10-24 06:21:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:21:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-10-24 06:21:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:18,736 INFO L225 Difference]: With dead ends: 180 [2024-10-24 06:21:18,736 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 06:21:18,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:18,738 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 105 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:18,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 228 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:21:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 06:21:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2024-10-24 06:21:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-24 06:21:18,770 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 150 [2024-10-24 06:21:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:18,772 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-24 06:21:18,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-24 06:21:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:21:18,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:18,778 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:18,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:21:18,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:18,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash 837363589, now seen corresponding path program 1 times [2024-10-24 06:21:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:18,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001373591] [2024-10-24 06:21:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:19,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001373591] [2024-10-24 06:21:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001373591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:19,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:19,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:21:19,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152749326] [2024-10-24 06:21:19,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:19,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:21:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:21:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:19,072 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:19,117 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2024-10-24 06:21:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:21:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:21:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:19,120 INFO L225 Difference]: With dead ends: 187 [2024-10-24 06:21:19,120 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 06:21:19,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:19,122 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:19,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 195 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:21:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 06:21:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-10-24 06:21:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 73 states have internal predecessors, (97), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 06:21:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2024-10-24 06:21:19,139 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 151 [2024-10-24 06:21:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2024-10-24 06:21:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2024-10-24 06:21:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:21:19,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:19,142 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:21:19,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -124457923, now seen corresponding path program 1 times [2024-10-24 06:21:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592343502] [2024-10-24 06:21:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592343502] [2024-10-24 06:21:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592343502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:21:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811833359] [2024-10-24 06:21:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:21:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:21:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:20,088 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:20,195 INFO L93 Difference]: Finished difference Result 249 states and 382 transitions. [2024-10-24 06:21:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:21:20,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:21:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:20,202 INFO L225 Difference]: With dead ends: 249 [2024-10-24 06:21:20,205 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 06:21:20,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:20,207 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 35 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:20,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 282 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:21:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 06:21:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 124. [2024-10-24 06:21:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.3625) internal successors, (109), 81 states have internal predecessors, (109), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 06:21:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 191 transitions. [2024-10-24 06:21:20,230 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 191 transitions. Word has length 151 [2024-10-24 06:21:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:20,231 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 191 transitions. [2024-10-24 06:21:20,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 191 transitions. [2024-10-24 06:21:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:21:20,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:20,237 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:20,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:21:20,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:20,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash -124398341, now seen corresponding path program 1 times [2024-10-24 06:21:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261556892] [2024-10-24 06:21:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261556892] [2024-10-24 06:21:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261556892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:20,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:20,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:21:20,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663604118] [2024-10-24 06:21:20,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:20,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:21:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:21:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:20,827 INFO L87 Difference]: Start difference. First operand 124 states and 191 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:21,080 INFO L93 Difference]: Finished difference Result 346 states and 530 transitions. [2024-10-24 06:21:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:21:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:21:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:21,084 INFO L225 Difference]: With dead ends: 346 [2024-10-24 06:21:21,084 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 06:21:21,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:21:21,086 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:21,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 349 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:21:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 06:21:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 183. [2024-10-24 06:21:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 06:21:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2024-10-24 06:21:21,118 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 151 [2024-10-24 06:21:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:21,119 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2024-10-24 06:21:21,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2024-10-24 06:21:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 06:21:21,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:21,121 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:21,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:21:21,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 758851411, now seen corresponding path program 1 times [2024-10-24 06:21:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585967299] [2024-10-24 06:21:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:21:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:21:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:21:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:21:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:21:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:21:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:21:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:21:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:21:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:21:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:21:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:21:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:21:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:21:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:21:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:21:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:21:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:21:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:21:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:21:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:21:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:21:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 06:21:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:21:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:21:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:21:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585967299] [2024-10-24 06:21:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585967299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:21:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109086551] [2024-10-24 06:21:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:21:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:21,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:21:21,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:21:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:21,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 06:21:21,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-10-24 06:21:22,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:21:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:21:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109086551] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:21:22,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:21:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-24 06:21:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807331535] [2024-10-24 06:21:22,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:21:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:21:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:21:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:21:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:21:22,544 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:21:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:22,804 INFO L93 Difference]: Finished difference Result 324 states and 478 transitions. [2024-10-24 06:21:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:21:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 152 [2024-10-24 06:21:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:22,807 INFO L225 Difference]: With dead ends: 324 [2024-10-24 06:21:22,807 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 06:21:22,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 347 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-10-24 06:21:22,811 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 177 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:22,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 166 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:21:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 06:21:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2024-10-24 06:21:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 06:21:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2024-10-24 06:21:22,855 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 152 [2024-10-24 06:21:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:22,856 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2024-10-24 06:21:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:21:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2024-10-24 06:21:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 06:21:22,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:22,858 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:22,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:21:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:21:23,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1237689986, now seen corresponding path program 1 times [2024-10-24 06:21:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:21:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328267206] [2024-10-24 06:21:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:21:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:21:23,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:21:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:21:23,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:21:23,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:21:23,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:21:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:21:23,390 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:23,492 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:21:23,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:21:23 BoogieIcfgContainer [2024-10-24 06:21:23,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:21:23,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:21:23,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:21:23,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:21:23,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:17" (3/4) ... [2024-10-24 06:21:23,498 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:21:23,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:21:23,499 INFO L158 Benchmark]: Toolchain (without parser) took 7798.93ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 147.5MB in the beginning and 98.1MB in the end (delta: 49.4MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,499 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:21:23,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.21ms. Allocated memory is still 216.0MB. Free memory was 147.2MB in the beginning and 131.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.69ms. Allocated memory is still 216.0MB. Free memory was 131.3MB in the beginning and 128.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,500 INFO L158 Benchmark]: Boogie Preprocessor took 95.29ms. Allocated memory is still 216.0MB. Free memory was 128.6MB in the beginning and 125.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,500 INFO L158 Benchmark]: RCFGBuilder took 872.10ms. Allocated memory is still 216.0MB. Free memory was 125.5MB in the beginning and 167.8MB in the end (delta: -42.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,500 INFO L158 Benchmark]: TraceAbstraction took 5964.88ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 166.9MB in the beginning and 99.1MB in the end (delta: 67.8MB). Peak memory consumption was 167.2MB. Max. memory is 16.1GB. [2024-10-24 06:21:23,501 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 312.5MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:21:23,502 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.30ms. Allocated memory is still 117.4MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.21ms. Allocated memory is still 216.0MB. Free memory was 147.2MB in the beginning and 131.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.69ms. Allocated memory is still 216.0MB. Free memory was 131.3MB in the beginning and 128.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.29ms. Allocated memory is still 216.0MB. Free memory was 128.6MB in the beginning and 125.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 872.10ms. Allocated memory is still 216.0MB. Free memory was 125.5MB in the beginning and 167.8MB in the end (delta: -42.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5964.88ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 166.9MB in the beginning and 99.1MB in the end (delta: 67.8MB). Peak memory consumption was 167.2MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 312.5MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 96. 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 long int var_1_24 = 16; [L42] signed char var_1_25 = 5; [L43] signed long int var_1_26 = -4; [L44] unsigned char var_1_27 = 0; [L45] signed short int var_1_28 = -16; [L46] float var_1_29 = 99999999.5; [L47] float var_1_30 = 24.63; [L48] float var_1_31 = 49.4; [L49] unsigned char var_1_32 = 1; [L50] unsigned long int last_1_var_1_10 = 128; [L51] unsigned long int last_1_var_1_16 = 1; [L52] double last_1_var_1_19 = 3.8; [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L163] last_1_var_1_10 = var_1_10 [L164] last_1_var_1_16 = var_1_16 [L165] last_1_var_1_19 = var_1_19 [L175] RET updateLastVariables() [L176] CALL updateVariables() [L123] var_1_2 = __VERIFIER_nondet_uchar() [L124] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L124] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L126] var_1_3 = __VERIFIER_nondet_uchar() [L127] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L127] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L128] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L128] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L129] var_1_7 = __VERIFIER_nondet_char() [L130] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L130] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L131] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L131] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L133] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L134] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L134] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L135] var_1_9 = __VERIFIER_nondet_char() [L136] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L136] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L137] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L137] 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L138] var_1_11 = __VERIFIER_nondet_ulong() [L139] 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L139] 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L140] 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L140] 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=-3221225473, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L141] var_1_17 = __VERIFIER_nondet_ulong() [L142] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L142] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L143] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L143] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L144] var_1_18 = __VERIFIER_nondet_ulong() [L145] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L145] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L146] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L146] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L147] var_1_20 = __VERIFIER_nondet_double() [L148] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L148] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L149] var_1_27 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_27 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L150] RET assume_abort_if_not(var_1_27 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_27 <= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L151] RET assume_abort_if_not(var_1_27 <= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_29=199999999/2, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L152] var_1_29 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L153] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_30=2463/100, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L154] var_1_30 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L155] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_31=247/5, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L156] var_1_31 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L157] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] var_1_32 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_32 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, 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_32 >= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_32 <= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] RET assume_abort_if_not(var_1_32 <= 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=16, var_1_25=5, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET updateVariables() [L177] CALL step() [L56] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) [L57] var_1_23 = 8 [L58] var_1_24 = var_1_22 [L59] var_1_25 = 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L60] COND TRUE var_1_25 > 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L61] COND FALSE !(\read(var_1_27)) 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L67] COND TRUE ! var_1_27 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, 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_29 * var_1_30) > var_1_31) 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L80] unsigned long int stepLocal_1 = last_1_var_1_16; [L81] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L82] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L83] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L91] COND TRUE var_1_12 == var_1_12 [L92] 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=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L94] var_1_1 = (var_1_2 || (! var_1_3)) [L95] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L96] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L97] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L98] COND FALSE !(var_1_19 >= var_1_19) [L103] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L108] COND TRUE var_1_19 != var_1_19 [L109] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L117] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L118] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L119] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L177] RET step() [L178] CALL, EXPR property() [L168-L169] 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) ; [L178] RET, EXPR property() [L178] 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, 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=7248252282, var_1_11=-3221225473, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=13835058059577131006U, var_1_18=13835058063872098301U, 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=8, var_1_24=25, var_1_25=32, var_1_26=-4, var_1_27=0, var_1_28=-16, var_1_2=1, var_1_32=0, 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, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 1325 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 639 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 110 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1210 NumberOfCodeBlocks, 1210 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2442 SizeOfPredicates, 3 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 8652/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:21:23,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-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 f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:21:27,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:21:27,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:21:27,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:21:27,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:21:27,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:21:27,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:21:27,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:21:27,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:21:27,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:21:27,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:21:27,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:21:27,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:21:27,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:21:27,163 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:21:27,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:21:27,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:21:27,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:21:27,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:21:27,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:21:27,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:21:27,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:21:27,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:21:27,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:21:27,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:21:27,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:21:27,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:21:27,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:21:27,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:21:27,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:21:27,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:21:27,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:21:27,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:21:27,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:21:27,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:27,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:21:27,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:21:27,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:21:27,175 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:21:27,175 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:21:27,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:21:27,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:21:27,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:21:27,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:21:27,177 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:21:27,177 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 -> f51ee4a7220dc2b51ff1b4163bfc3c5ced88b90b523c25a3c78fe5519978425e [2024-10-24 06:21:27,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:21:27,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:21:27,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:21:27,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:21:27,582 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:21:27,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:29,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:21:30,029 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:21:30,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:30,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9813e81/edf514bb034a43fca600ad27bc110b1b/FLAGd60f62e13 [2024-10-24 06:21:30,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9813e81/edf514bb034a43fca600ad27bc110b1b [2024-10-24 06:21:30,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:21:30,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:21:30,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:30,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:21:30,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:21:30,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcdfc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30, skipping insertion in model container [2024-10-24 06:21:30,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:21:30,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i[915,928] [2024-10-24 06:21:30,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:30,756 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:21:30,773 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-11.i[915,928] [2024-10-24 06:21:30,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:21:30,874 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:21:30,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30 WrapperNode [2024-10-24 06:21:30,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:21:30,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:30,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:21:30,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:21:30,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,956 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-24 06:21:30,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:21:30,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:21:30,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:21:30,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:21:30,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:30,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:21:31,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:21:31,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:21:31,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:21:31,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:21:31,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (1/1) ... [2024-10-24 06:21:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:21:31,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:21:31,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:21:31,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:21:31,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:21:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:21:31,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:21:31,235 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:21:31,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:21:32,133 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:21:32,133 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:21:32,205 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:21:32,205 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:21:32,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:32 BoogieIcfgContainer [2024-10-24 06:21:32,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:21:32,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:21:32,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:21:32,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:21:32,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:21:30" (1/3) ... [2024-10-24 06:21:32,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b98b005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:32, skipping insertion in model container [2024-10-24 06:21:32,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:21:30" (2/3) ... [2024-10-24 06:21:32,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b98b005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:21:32, skipping insertion in model container [2024-10-24 06:21:32,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:21:32" (3/3) ... [2024-10-24 06:21:32,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-11.i [2024-10-24 06:21:32,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:21:32,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:21:32,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:21:32,335 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;@297b70e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:21:32,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:21:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.5) internal successors, (66), 45 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 06:21:32,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:32,357 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:32,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1907298635, now seen corresponding path program 1 times [2024-10-24 06:21:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836113567] [2024-10-24 06:21:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:32,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:32,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:21:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:32,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:21:32,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-24 06:21:32,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:32,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836113567] [2024-10-24 06:21:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836113567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:21:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888655877] [2024-10-24 06:21:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:32,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:21:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:21:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:32,848 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.5) internal successors, (66), 45 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:21:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:32,920 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2024-10-24 06:21:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:21:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-10-24 06:21:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:32,944 INFO L225 Difference]: With dead ends: 139 [2024-10-24 06:21:32,945 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 06:21:32,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:21:32,955 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:32,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:21:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 06:21:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 06:21:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2024-10-24 06:21:33,000 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 150 [2024-10-24 06:21:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:33,001 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2024-10-24 06:21:33,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:21:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2024-10-24 06:21:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 06:21:33,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:33,005 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:33,017 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-10-24 06:21:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:33,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:33,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 881096207, now seen corresponding path program 1 times [2024-10-24 06:21:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146943146] [2024-10-24 06:21:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:33,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:33,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:21:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:33,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:21:33,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:33,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:33,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146943146] [2024-10-24 06:21:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146943146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:21:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408245562] [2024-10-24 06:21:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:33,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:21:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:21:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:33,512 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:33,647 INFO L93 Difference]: Finished difference Result 180 states and 281 transitions. [2024-10-24 06:21:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:21:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-10-24 06:21:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:33,651 INFO L225 Difference]: With dead ends: 180 [2024-10-24 06:21:33,651 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 06:21:33,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:33,657 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 105 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:33,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 228 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:21:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 06:21:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2024-10-24 06:21:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:21:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-24 06:21:33,673 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 150 [2024-10-24 06:21:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:33,675 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-24 06:21:33,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-24 06:21:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:21:33,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:33,678 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:33,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:21:33,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:33,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:33,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash 837363589, now seen corresponding path program 1 times [2024-10-24 06:21:33,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:33,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997761825] [2024-10-24 06:21:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:33,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:33,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:21:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:34,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:21:34,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:34,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:34,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997761825] [2024-10-24 06:21:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997761825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:34,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:21:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572909787] [2024-10-24 06:21:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:34,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:21:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:21:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:34,124 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:34,191 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2024-10-24 06:21:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:21:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:21:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:34,194 INFO L225 Difference]: With dead ends: 187 [2024-10-24 06:21:34,194 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 06:21:34,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:21:34,196 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:34,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:21:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 06:21:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-10-24 06:21:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 73 states have internal predecessors, (97), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 06:21:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2024-10-24 06:21:34,212 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 151 [2024-10-24 06:21:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:34,212 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2024-10-24 06:21:34,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2024-10-24 06:21:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:21:34,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:34,215 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:34,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:21:34,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:34,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash -124457923, now seen corresponding path program 1 times [2024-10-24 06:21:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357872032] [2024-10-24 06:21:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:34,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:34,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:21:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:34,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:21:34,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:35,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:35,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357872032] [2024-10-24 06:21:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357872032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:35,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:21:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666302270] [2024-10-24 06:21:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:21:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:21:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:35,447 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:35,836 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2024-10-24 06:21:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:21:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:21:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:35,845 INFO L225 Difference]: With dead ends: 322 [2024-10-24 06:21:35,846 INFO L226 Difference]: Without dead ends: 207 [2024-10-24 06:21:35,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:21:35,847 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 71 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:35,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 349 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:21:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-24 06:21:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 175. [2024-10-24 06:21:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 106 states have internal predecessors, (135), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 06:21:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2024-10-24 06:21:35,892 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 151 [2024-10-24 06:21:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2024-10-24 06:21:35,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2024-10-24 06:21:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 06:21:35,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:35,896 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:35,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 06:21:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:36,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 758791829, now seen corresponding path program 1 times [2024-10-24 06:21:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371781768] [2024-10-24 06:21:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:36,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:36,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 (6)] Waiting until timeout for monitored process [2024-10-24 06:21:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:36,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:21:36,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-10-24 06:21:36,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:21:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:21:36,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371781768] [2024-10-24 06:21:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371781768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:21:36,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:21:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 06:21:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692630440] [2024-10-24 06:21:36,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:21:36,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:21:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:21:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:21:36,877 INFO L87 Difference]: Start difference. First operand 175 states and 265 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:21:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:37,324 INFO L93 Difference]: Finished difference Result 316 states and 466 transitions. [2024-10-24 06:21:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:21:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 152 [2024-10-24 06:21:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:37,330 INFO L225 Difference]: With dead ends: 316 [2024-10-24 06:21:37,330 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 06:21:37,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 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-10-24 06:21:37,332 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:37,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 164 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:21:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 06:21:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2024-10-24 06:21:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 06:21:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2024-10-24 06:21:37,360 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 152 [2024-10-24 06:21:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:37,361 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2024-10-24 06:21:37,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:21:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2024-10-24 06:21:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 06:21:37,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:37,364 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:37,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 06:21:37,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:37,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:37,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1237689986, now seen corresponding path program 1 times [2024-10-24 06:21:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662512007] [2024-10-24 06:21:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:37,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:37,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 06:21:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:38,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:21:38,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:21:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:21:38,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:21:38,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:21:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662512007] [2024-10-24 06:21:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662512007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:21:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:21:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:21:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096557697] [2024-10-24 06:21:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:21:38,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:21:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:21:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:21:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:21:38,942 INFO L87 Difference]: Start difference. First operand 187 states and 270 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:21:41,549 INFO L93 Difference]: Finished difference Result 318 states and 462 transitions. [2024-10-24 06:21:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:21:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-24 06:21:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:21:41,553 INFO L225 Difference]: With dead ends: 318 [2024-10-24 06:21:41,553 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 06:21:41,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:21:41,561 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 78 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:21:41,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 242 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 06:21:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 06:21:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-10-24 06:21:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 06:21:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 266 transitions. [2024-10-24 06:21:41,635 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 266 transitions. Word has length 153 [2024-10-24 06:21:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:21:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 266 transitions. [2024-10-24 06:21:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:21:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 266 transitions. [2024-10-24 06:21:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 06:21:41,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:21:41,643 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:21:41,667 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 (7)] Ended with exit code 0 [2024-10-24 06:21:41,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:41,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:21:41,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:21:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -350364893, now seen corresponding path program 1 times [2024-10-24 06:21:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:21:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537344493] [2024-10-24 06:21:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:21:41,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:21:41,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:21:41,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:21:41,851 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 (8)] Waiting until timeout for monitored process [2024-10-24 06:21:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:21:42,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 06:21:42,239 INFO L278 TraceCheckSpWp]: Computing forward predicates...