./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.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 3e0e2a51cba6619c60a0d142b944dce1da7a8feb12d2fde5ff67da29a0614d39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:49:51,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:49:51,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:49:52,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:49:52,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:49:52,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:49:52,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:49:52,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:49:52,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:49:52,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:49:52,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:49:52,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:49:52,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:49:52,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:49:52,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:49:52,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:49:52,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:49:52,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:49:52,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:49:52,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:49:52,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:49:52,033 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3e0e2a51cba6619c60a0d142b944dce1da7a8feb12d2fde5ff67da29a0614d39 [2025-03-03 20:49:52,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:49:52,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:49:52,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:49:52,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:49:52,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:49:52,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:49:53,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6724b120e/85528c53afbb44fbbed8eb32fa66b25c/FLAG916708200 [2025-03-03 20:49:53,690 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:49:53,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:49:53,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6724b120e/85528c53afbb44fbbed8eb32fa66b25c/FLAG916708200 [2025-03-03 20:49:53,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6724b120e/85528c53afbb44fbbed8eb32fa66b25c [2025-03-03 20:49:53,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:49:53,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:49:53,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:49:53,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:49:53,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:49:54,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:49:53" (1/1) ... [2025-03-03 20:49:54,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e3e332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54, skipping insertion in model container [2025-03-03 20:49:54,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:49:53" (1/1) ... [2025-03-03 20:49:54,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:49:54,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i[919,932] [2025-03-03 20:49:54,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:49:54,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:49:54,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i[919,932] [2025-03-03 20:49:54,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:49:54,261 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:49:54,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54 WrapperNode [2025-03-03 20:49:54,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:49:54,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:49:54,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:49:54,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:49:54,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,310 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-03-03 20:49:54,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:49:54,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:49:54,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:49:54,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:49:54,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,331 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]. [2025-03-03 20:49:54,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:49:54,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:49:54,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:49:54,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:49:54,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (1/1) ... [2025-03-03 20:49:54,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:49:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:49:54,377 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) [2025-03-03 20:49:54,379 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 [2025-03-03 20:49:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:49:54,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:49:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:49:54,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:49:54,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:49:54,451 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:49:54,741 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:49:54,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:49:54,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:49:54,760 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:49:54,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:49:54 BoogieIcfgContainer [2025-03-03 20:49:54,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:49:54,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:49:54,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:49:54,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:49:54,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:49:53" (1/3) ... [2025-03-03 20:49:54,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25eff2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:49:54, skipping insertion in model container [2025-03-03 20:49:54,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:49:54" (2/3) ... [2025-03-03 20:49:54,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25eff2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:49:54, skipping insertion in model container [2025-03-03 20:49:54,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:49:54" (3/3) ... [2025-03-03 20:49:54,769 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:49:54,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:49:54,783 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:49:54,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:49:54,841 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;@49266ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:49:54,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:49:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 66 states have internal predecessors, (99), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:49:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 20:49:54,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:54,859 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:54,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:54,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2024753195, now seen corresponding path program 1 times [2025-03-03 20:49:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586842663] [2025-03-03 20:49:54,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:54,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:49:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:49:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:49:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586842663] [2025-03-03 20:49:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586842663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:49:55,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722296921] [2025-03-03 20:49:55,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:55,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:49:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:49:55,113 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) [2025-03-03 20:49:55,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:49:55,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:49:55,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:49:55,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:55,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:55,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:49:55,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:49:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:49:55,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:49:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722296921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:49:55,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:49:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919901949] [2025-03-03 20:49:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:55,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:49:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:49:55,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:49:55,286 INFO L87 Difference]: Start difference. First operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 66 states have internal predecessors, (99), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:49:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:55,316 INFO L93 Difference]: Finished difference Result 174 states and 303 transitions. [2025-03-03 20:49:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:49:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-03-03 20:49:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:55,324 INFO L225 Difference]: With dead ends: 174 [2025-03-03 20:49:55,325 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 20:49:55,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:49:55,330 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:55,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:49:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 20:49:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 20:49:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.492063492063492) internal successors, (94), 63 states have internal predecessors, (94), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:49:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2025-03-03 20:49:55,370 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 151 [2025-03-03 20:49:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:55,370 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2025-03-03 20:49:55,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:49:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2025-03-03 20:49:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 20:49:55,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:55,374 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:55,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:49:55,575 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,SelfDestructingSolverStorable0 [2025-03-03 20:49:55,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 592729995, now seen corresponding path program 1 times [2025-03-03 20:49:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083805867] [2025-03-03 20:49:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:49:55,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:49:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:55,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083805867] [2025-03-03 20:49:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083805867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:49:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056920282] [2025-03-03 20:49:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:49:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:55,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:49:55,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:49:55,780 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:55,876 INFO L93 Difference]: Finished difference Result 253 states and 404 transitions. [2025-03-03 20:49:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:49:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 20:49:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:55,879 INFO L225 Difference]: With dead ends: 253 [2025-03-03 20:49:55,879 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 20:49:55,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:49:55,880 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 122 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:55,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 324 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:49:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 20:49:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 106. [2025-03-03 20:49:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:49:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2025-03-03 20:49:55,898 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 151 [2025-03-03 20:49:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:55,899 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2025-03-03 20:49:55,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2025-03-03 20:49:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:49:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:55,901 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:49:55,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:55,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1212538248, now seen corresponding path program 1 times [2025-03-03 20:49:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:55,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365759946] [2025-03-03 20:49:55,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:55,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:49:55,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:49:55,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365759946] [2025-03-03 20:49:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365759946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:49:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472026515] [2025-03-03 20:49:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:56,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:49:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:56,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:49:56,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:56,152 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:56,369 INFO L93 Difference]: Finished difference Result 468 states and 745 transitions. [2025-03-03 20:49:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:49:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:49:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:56,373 INFO L225 Difference]: With dead ends: 468 [2025-03-03 20:49:56,373 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 20:49:56,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:49:56,377 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 352 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:56,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 744 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:49:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 20:49:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 245. [2025-03-03 20:49:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 175 states have (on average 1.4285714285714286) internal successors, (250), 175 states have internal predecessors, (250), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 20:49:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2025-03-03 20:49:56,416 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 152 [2025-03-03 20:49:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:56,417 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2025-03-03 20:49:56,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2025-03-03 20:49:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:49:56,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:56,422 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:56,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:49:56,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1837664567, now seen corresponding path program 1 times [2025-03-03 20:49:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254652375] [2025-03-03 20:49:56,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:56,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:49:56,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:49:56,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254652375] [2025-03-03 20:49:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254652375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:56,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:49:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863441594] [2025-03-03 20:49:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:56,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:49:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:56,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:49:56,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:56,653 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:56,858 INFO L93 Difference]: Finished difference Result 513 states and 808 transitions. [2025-03-03 20:49:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:49:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:49:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:56,862 INFO L225 Difference]: With dead ends: 513 [2025-03-03 20:49:56,863 INFO L226 Difference]: Without dead ends: 410 [2025-03-03 20:49:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:49:56,867 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 207 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:56,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 514 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:49:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-03 20:49:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 245. [2025-03-03 20:49:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 175 states have internal predecessors, (249), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 20:49:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 381 transitions. [2025-03-03 20:49:56,904 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 381 transitions. Word has length 152 [2025-03-03 20:49:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:56,904 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 381 transitions. [2025-03-03 20:49:56,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 381 transitions. [2025-03-03 20:49:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 20:49:56,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:56,907 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:49:56,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1209983961, now seen corresponding path program 1 times [2025-03-03 20:49:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165954968] [2025-03-03 20:49:56,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:56,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 20:49:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 20:49:56,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:56,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165954968] [2025-03-03 20:49:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165954968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:57,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:49:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111110501] [2025-03-03 20:49:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:49:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:49:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:57,084 INFO L87 Difference]: Start difference. First operand 245 states and 381 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:57,502 INFO L93 Difference]: Finished difference Result 757 states and 1196 transitions. [2025-03-03 20:49:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:49:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 20:49:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:57,507 INFO L225 Difference]: With dead ends: 757 [2025-03-03 20:49:57,509 INFO L226 Difference]: Without dead ends: 654 [2025-03-03 20:49:57,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:49:57,511 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 452 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:57,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 800 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:49:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-03 20:49:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 409. [2025-03-03 20:49:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 293 states have (on average 1.416382252559727) internal successors, (415), 293 states have internal predecessors, (415), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 20:49:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 635 transitions. [2025-03-03 20:49:57,553 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 635 transitions. Word has length 152 [2025-03-03 20:49:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:57,553 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 635 transitions. [2025-03-03 20:49:57,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 635 transitions. [2025-03-03 20:49:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:49:57,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:57,555 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:57,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:49:57,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1588308379, now seen corresponding path program 1 times [2025-03-03 20:49:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764615150] [2025-03-03 20:49:57,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:57,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:49:57,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:49:57,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:57,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:57,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:57,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764615150] [2025-03-03 20:49:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764615150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:57,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:57,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:49:57,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201003089] [2025-03-03 20:49:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:57,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:49:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:57,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:49:57,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:49:57,737 INFO L87 Difference]: Start difference. First operand 409 states and 635 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:58,004 INFO L93 Difference]: Finished difference Result 752 states and 1167 transitions. [2025-03-03 20:49:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:49:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 20:49:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:58,008 INFO L225 Difference]: With dead ends: 752 [2025-03-03 20:49:58,008 INFO L226 Difference]: Without dead ends: 553 [2025-03-03 20:49:58,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:49:58,012 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 380 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:58,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 760 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:49:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-03 20:49:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 411. [2025-03-03 20:49:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 295 states have internal predecessors, (417), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 20:49:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 637 transitions. [2025-03-03 20:49:58,042 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 637 transitions. Word has length 153 [2025-03-03 20:49:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:58,042 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 637 transitions. [2025-03-03 20:49:58,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 637 transitions. [2025-03-03 20:49:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 20:49:58,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:58,044 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:58,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:49:58,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:58,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 909707558, now seen corresponding path program 1 times [2025-03-03 20:49:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323964871] [2025-03-03 20:49:58,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:58,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:58,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 20:49:58,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 20:49:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:58,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323964871] [2025-03-03 20:49:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323964871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:58,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:49:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826822515] [2025-03-03 20:49:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:58,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:49:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:58,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:49:58,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:49:58,198 INFO L87 Difference]: Start difference. First operand 411 states and 637 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:58,283 INFO L93 Difference]: Finished difference Result 1109 states and 1726 transitions. [2025-03-03 20:49:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:49:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-03-03 20:49:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:58,289 INFO L225 Difference]: With dead ends: 1109 [2025-03-03 20:49:58,289 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 20:49:58,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:49:58,290 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 82 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:58,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 269 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:49:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 20:49:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 743. [2025-03-03 20:49:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 535 states have (on average 1.4037383177570093) internal successors, (751), 535 states have internal predecessors, (751), 198 states have call successors, (198), 9 states have call predecessors, (198), 9 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 20:49:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1147 transitions. [2025-03-03 20:49:58,334 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1147 transitions. Word has length 153 [2025-03-03 20:49:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:58,334 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1147 transitions. [2025-03-03 20:49:58,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1147 transitions. [2025-03-03 20:49:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 20:49:58,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:58,336 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:58,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:49:58,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:58,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2065509205, now seen corresponding path program 1 times [2025-03-03 20:49:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433092898] [2025-03-03 20:49:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:58,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 20:49:58,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 20:49:58,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:58,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433092898] [2025-03-03 20:49:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433092898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:49:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468236832] [2025-03-03 20:49:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:49:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:58,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:49:58,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:49:58,796 INFO L87 Difference]: Start difference. First operand 743 states and 1147 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:59,289 INFO L93 Difference]: Finished difference Result 1509 states and 2308 transitions. [2025-03-03 20:49:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:49:59,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-03-03 20:49:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:59,295 INFO L225 Difference]: With dead ends: 1509 [2025-03-03 20:49:59,295 INFO L226 Difference]: Without dead ends: 1145 [2025-03-03 20:49:59,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:49:59,296 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 369 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:59,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 503 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:49:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-03 20:49:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1005. [2025-03-03 20:49:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 753 states have (on average 1.406374501992032) internal successors, (1059), 757 states have internal predecessors, (1059), 238 states have call successors, (238), 13 states have call predecessors, (238), 13 states have return successors, (238), 234 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-03 20:49:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1535 transitions. [2025-03-03 20:49:59,367 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1535 transitions. Word has length 154 [2025-03-03 20:49:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:59,367 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1535 transitions. [2025-03-03 20:49:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1535 transitions. [2025-03-03 20:49:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 20:49:59,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:59,368 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:59,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:49:59,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:59,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1440270010, now seen corresponding path program 1 times [2025-03-03 20:49:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:59,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055120584] [2025-03-03 20:49:59,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 20:49:59,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 20:49:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:59,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:59,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055120584] [2025-03-03 20:49:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055120584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:49:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002849125] [2025-03-03 20:49:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:59,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:49:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:59,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:49:59,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:59,627 INFO L87 Difference]: Start difference. First operand 1005 states and 1535 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:49:59,696 INFO L93 Difference]: Finished difference Result 1247 states and 1914 transitions. [2025-03-03 20:49:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:49:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-03-03 20:49:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:49:59,698 INFO L225 Difference]: With dead ends: 1247 [2025-03-03 20:49:59,699 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 20:49:59,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:49:59,701 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:49:59,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:49:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 20:49:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 210. [2025-03-03 20:49:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 20:49:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 317 transitions. [2025-03-03 20:49:59,725 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 317 transitions. Word has length 155 [2025-03-03 20:49:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:49:59,726 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 317 transitions. [2025-03-03 20:49:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:49:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 317 transitions. [2025-03-03 20:49:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 20:49:59,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:49:59,729 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:49:59,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:49:59,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:49:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:49:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1613260672, now seen corresponding path program 1 times [2025-03-03 20:49:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:49:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412636838] [2025-03-03 20:49:59,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:49:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:49:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 20:49:59,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 20:49:59,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:49:59,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:49:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:49:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:49:59,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412636838] [2025-03-03 20:49:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412636838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:49:59,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:49:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:49:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544303782] [2025-03-03 20:49:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:49:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:49:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:49:59,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:49:59,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:49:59,889 INFO L87 Difference]: Start difference. First operand 210 states and 317 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:00,112 INFO L93 Difference]: Finished difference Result 533 states and 796 transitions. [2025-03-03 20:50:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:50:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2025-03-03 20:50:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:00,115 INFO L225 Difference]: With dead ends: 533 [2025-03-03 20:50:00,115 INFO L226 Difference]: Without dead ends: 370 [2025-03-03 20:50:00,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:50:00,116 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 338 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:00,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 620 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:50:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-03 20:50:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 289. [2025-03-03 20:50:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 196 states have (on average 1.3214285714285714) internal successors, (259), 196 states have internal predecessors, (259), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 20:50:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 435 transitions. [2025-03-03 20:50:00,139 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 435 transitions. Word has length 156 [2025-03-03 20:50:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 435 transitions. [2025-03-03 20:50:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 435 transitions. [2025-03-03 20:50:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 20:50:00,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:00,142 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:50:00,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash -183690687, now seen corresponding path program 1 times [2025-03-03 20:50:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139229263] [2025-03-03 20:50:00,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 20:50:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 20:50:00,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:00,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:50:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732995646] [2025-03-03 20:50:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:00,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:00,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:50:00,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:50:00,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 20:50:00,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 20:50:00,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:00,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:50:00,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:50:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 20:50:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 20:50:00,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:50:00,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:50:00,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:50:00,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:50:00,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:50:00,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 20:50:00,657 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:00,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:50:00,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:50:00 BoogieIcfgContainer [2025-03-03 20:50:00,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:50:00,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:50:00,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:50:00,748 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:50:00,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:49:54" (3/4) ... [2025-03-03 20:50:00,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:50:00,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:50:00,754 INFO L158 Benchmark]: Toolchain (without parser) took 6758.41ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 104.8MB in the beginning and 154.4MB in the end (delta: -49.6MB). Peak memory consumption was 196.3MB. Max. memory is 16.1GB. [2025-03-03 20:50:00,754 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:50:00,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.82ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:50:00,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.50ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:50:00,754 INFO L158 Benchmark]: Boogie Preprocessor took 32.45ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:50:00,754 INFO L158 Benchmark]: IcfgBuilder took 416.93ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 53.6MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:50:00,755 INFO L158 Benchmark]: TraceAbstraction took 5984.93ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.7MB in the beginning and 154.5MB in the end (delta: -101.8MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2025-03-03 20:50:00,755 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 385.9MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:50:00,755 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.82ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.50ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.45ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 416.93ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 53.6MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5984.93ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.7MB in the beginning and 154.5MB in the end (delta: -101.8MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 385.9MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of bitwiseOr at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] double var_1_29 = 256.7; [L42] unsigned long int var_1_30 = 5; [L43] signed long int var_1_32 = 32; [L44] float var_1_34 = 7.5; [L45] unsigned short int var_1_35 = 100; [L46] signed short int var_1_36 = -4; [L47] unsigned short int var_1_37 = 47055; [L48] signed char var_1_39 = -64; [L49] double var_1_40 = 16.75; [L50] signed char var_1_41 = 16; [L51] signed long int last_1_var_1_1 = -256; [L52] signed short int last_1_var_1_5 = -256; [L53] unsigned char last_1_var_1_10 = 0; [L54] unsigned short int last_1_var_1_19 = 5; [L55] signed short int last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_5 = var_1_5 [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_19 = var_1_19 [L200] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_7=1025/4, var_1_8=639/5] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L159] var_1_7 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L160] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L161] var_1_8 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] var_1_11 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_13 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_14 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] var_1_15 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_16 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] var_1_18 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] var_1_29 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L181] var_1_36 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_36 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_36 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L185] var_1_37 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L186] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L188] var_1_40 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L191] var_1_41 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L192] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L211] RET updateVariables() [L212] CALL step() [L59] signed long int stepLocal_2 = last_1_var_1_5; [L60] unsigned char stepLocal_1 = last_1_var_1_10; [L61] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L62] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L67] COND TRUE last_1_var_1_1 >= stepLocal_2 [L68] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L73] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L74] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L79] var_1_22 = last_1_var_1_22 [L80] var_1_23 = var_1_14 [L81] unsigned char stepLocal_5 = var_1_10; [L82] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=-205, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L83] COND TRUE var_1_22 < stepLocal_4 [L84] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L92] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L93] COND TRUE ! (var_1_23 <= var_1_7) [L94] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L102] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L103] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L106] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L107] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L112] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L115] COND TRUE var_1_1 < var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L116] EXPR var_1_1 ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L116] COND FALSE !(var_1_19 < (var_1_1 ^ var_1_17)) [L126] COND FALSE !(var_1_10 || var_1_10) [L129] var_1_30 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L131] COND FALSE !(var_1_29 > var_1_12) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L142] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L143] EXPR (var_1_22 % var_1_36) ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L143] COND TRUE ((var_1_22 % var_1_36) ^ var_1_17) != var_1_21 [L144] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_17) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=5] [L146] COND FALSE !(((var_1_12 / var_1_40) * var_1_12) > var_1_29) [L155] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3, var_1_13=3, var_1_14=2, var_1_15=16, var_1_17=16, var_1_18=-205, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=2, var_1_24=16, var_1_28=31/2, var_1_29=4, var_1_30=5, var_1_32=32, var_1_34=4, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2429 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2429 mSDsluCounter, 4784 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3118 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1076 IncrementalHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 1666 mSDtfsCounter, 1076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1037 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1992 NumberOfCodeBlocks, 1992 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 3583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 10122/10164 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:50:00,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.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 3e0e2a51cba6619c60a0d142b944dce1da7a8feb12d2fde5ff67da29a0614d39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:50:02,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:50:02,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:50:02,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:50:02,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:50:02,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:50:02,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:50:02,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:50:02,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:50:02,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:50:02,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:50:02,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:50:02,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:50:02,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:50:02,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:50:02,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:50:02,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:50:02,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:50:02,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3e0e2a51cba6619c60a0d142b944dce1da7a8feb12d2fde5ff67da29a0614d39 [2025-03-03 20:50:02,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:50:02,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:50:02,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:50:02,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:50:02,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:50:02,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:50:04,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e35670/a67c93fef4584d1bbfb309c20aaa2d58/FLAGd4686698f [2025-03-03 20:50:04,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:50:04,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:50:04,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e35670/a67c93fef4584d1bbfb309c20aaa2d58/FLAGd4686698f [2025-03-03 20:50:04,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e35670/a67c93fef4584d1bbfb309c20aaa2d58 [2025-03-03 20:50:04,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:50:04,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:50:04,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:50:04,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:50:04,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:50:04,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f654b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04, skipping insertion in model container [2025-03-03 20:50:04,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:50:04,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i[919,932] [2025-03-03 20:50:04,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:50:04,901 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:50:04,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i[919,932] [2025-03-03 20:50:04,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:50:04,945 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:50:04,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04 WrapperNode [2025-03-03 20:50:04,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:50:04,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:50:04,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:50:04,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:50:04,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,984 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-03 20:50:04,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:50:04,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:50:04,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:50:04,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:50:04,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:04,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,009 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]. [2025-03-03 20:50:05,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:50:05,021 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:50:05,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:50:05,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:50:05,022 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (1/1) ... [2025-03-03 20:50:05,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:50:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:05,056 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) [2025-03-03 20:50:05,059 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 [2025-03-03 20:50:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:50:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:50:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:50:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:50:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:50:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:50:05,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:50:05,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:50:17,391 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:50:17,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:50:17,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:50:17,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:50:17,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:50:17 BoogieIcfgContainer [2025-03-03 20:50:17,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:50:17,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:50:17,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:50:17,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:50:17,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:50:04" (1/3) ... [2025-03-03 20:50:17,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db5fe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:50:17, skipping insertion in model container [2025-03-03 20:50:17,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:04" (2/3) ... [2025-03-03 20:50:17,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db5fe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:50:17, skipping insertion in model container [2025-03-03 20:50:17,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:50:17" (3/3) ... [2025-03-03 20:50:17,406 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i [2025-03-03 20:50:17,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:50:17,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-25.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:50:17,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:50:17,467 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;@4385bb6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:50:17,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:50:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:50:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:50:17,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:17,479 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:17,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:17,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1152430603, now seen corresponding path program 1 times [2025-03-03 20:50:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:50:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392193288] [2025-03-03 20:50:17,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:17,491 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 [2025-03-03 20:50:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:50:17,493 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) [2025-03-03 20:50:17,494 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 [2025-03-03 20:50:17,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:50:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:50:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:18,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:50:18,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 20:50:18,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:50:18,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:50:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392193288] [2025-03-03 20:50:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392193288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:50:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705899006] [2025-03-03 20:50:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:18,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:50:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:50:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:50:18,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:50:18,544 INFO L87 Difference]: Start difference. First operand has 82 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:50:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:18,561 INFO L93 Difference]: Finished difference Result 158 states and 275 transitions. [2025-03-03 20:50:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:50:18,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 20:50:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:18,567 INFO L225 Difference]: With dead ends: 158 [2025-03-03 20:50:18,567 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 20:50:18,582 INFO L434 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 [2025-03-03 20:50:18,584 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:50:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 20:50:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 20:50:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:50:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2025-03-03 20:50:18,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 150 [2025-03-03 20:50:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:18,623 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2025-03-03 20:50:18,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:50:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2025-03-03 20:50:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:50:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:18,628 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:18,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:50:18,828 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 [2025-03-03 20:50:18,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1937520299, now seen corresponding path program 1 times [2025-03-03 20:50:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:50:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350463447] [2025-03-03 20:50:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:18,830 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 [2025-03-03 20:50:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:50:18,832 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) [2025-03-03 20:50:18,833 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 [2025-03-03 20:50:18,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:50:19,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:50:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:19,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:50:19,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:50:24,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:50:24,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:50:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350463447] [2025-03-03 20:50:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350463447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:24,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:50:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609207990] [2025-03-03 20:50:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:24,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:50:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:50:24,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:50:24,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:24,980 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:26,028 INFO L93 Difference]: Finished difference Result 155 states and 245 transitions. [2025-03-03 20:50:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:50:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:50:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:26,044 INFO L225 Difference]: With dead ends: 155 [2025-03-03 20:50:26,045 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 20:50:26,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:50:26,046 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:26,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 104 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:50:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 20:50:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 20:50:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:50:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2025-03-03 20:50:26,057 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 150 [2025-03-03 20:50:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:26,058 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2025-03-03 20:50:26,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2025-03-03 20:50:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 20:50:26,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:26,060 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:26,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:50:26,264 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 [2025-03-03 20:50:26,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -276919588, now seen corresponding path program 1 times [2025-03-03 20:50:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:50:26,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579579642] [2025-03-03 20:50:26,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:26,265 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 [2025-03-03 20:50:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:50:26,267 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) [2025-03-03 20:50:26,268 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 [2025-03-03 20:50:26,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:50:27,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:50:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:27,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:50:27,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:50:32,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:50:32,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:50:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579579642] [2025-03-03 20:50:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579579642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:50:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055169838] [2025-03-03 20:50:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:50:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:50:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:50:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:50:32,855 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:36,735 INFO L93 Difference]: Finished difference Result 337 states and 511 transitions. [2025-03-03 20:50:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:50:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 20:50:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:36,753 INFO L225 Difference]: With dead ends: 337 [2025-03-03 20:50:36,753 INFO L226 Difference]: Without dead ends: 261 [2025-03-03 20:50:36,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:50:36,754 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 307 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:36,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 482 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 20:50:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-03 20:50:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 193. [2025-03-03 20:50:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 20:50:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 293 transitions. [2025-03-03 20:50:36,790 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 293 transitions. Word has length 151 [2025-03-03 20:50:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:36,791 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 293 transitions. [2025-03-03 20:50:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:50:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 293 transitions. [2025-03-03 20:50:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 20:50:36,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:36,793 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:36,827 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 [2025-03-03 20:50:36,993 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 [2025-03-03 20:50:36,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:36,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -473433093, now seen corresponding path program 1 times [2025-03-03 20:50:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:50:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052086793] [2025-03-03 20:50:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:36,998 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 [2025-03-03 20:50:36,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:50:37,001 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) [2025-03-03 20:50:37,002 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 [2025-03-03 20:50:37,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:50:38,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:50:38,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:38,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:38,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 20:50:38,068 INFO L279 TraceCheckSpWp]: Computing forward predicates...