./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:00:39,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:00:39,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:00:39,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:00:39,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:00:39,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:00:39,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:00:39,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:00:39,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:00:39,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:00:39,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:00:39,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:00:39,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:00:39,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:00:39,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:00:39,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:00:39,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:00:39,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:00:39,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:00:39,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:00:39,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:00:39,894 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2025-03-03 21:00:40,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:00:40,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:00:40,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:00:40,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:00:40,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:00:40,129 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-pr-ci_file-17.i [2025-03-03 21:00:41,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8950091a/9d1d6a279b294c04b17d03f916069090/FLAG2f37e595c [2025-03-03 21:00:41,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:00:41,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-03 21:00:41,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8950091a/9d1d6a279b294c04b17d03f916069090/FLAG2f37e595c [2025-03-03 21:00:41,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8950091a/9d1d6a279b294c04b17d03f916069090 [2025-03-03 21:00:41,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:00:41,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:00:41,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:00:41,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:00:41,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:00:41,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb96fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41, skipping insertion in model container [2025-03-03 21:00:41,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:00:41,595 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-pr-ci_file-17.i[919,932] [2025-03-03 21:00:41,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:00:41,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:00:41,680 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-pr-ci_file-17.i[919,932] [2025-03-03 21:00:41,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:00:41,731 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:00:41,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41 WrapperNode [2025-03-03 21:00:41,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:00:41,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:00:41,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:00:41,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:00:41,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,776 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2025-03-03 21:00:41,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:00:41,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:00:41,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:00:41,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:00:41,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,797 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 21:00:41,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:00:41,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:00:41,808 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:00:41,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:00:41,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (1/1) ... [2025-03-03 21:00:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:00:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:00:41,832 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 21:00:41,834 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 21:00:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:00:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:00:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:00:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:00:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:00:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:00:41,912 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:00:41,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:00:42,279 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: havoc property_#t~ite20#1;havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short21#1; [2025-03-03 21:00:42,306 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:00:42,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:00:42,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:00:42,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:00:42,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:42 BoogieIcfgContainer [2025-03-03 21:00:42,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:00:42,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:00:42,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:00:42,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:00:42,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:00:41" (1/3) ... [2025-03-03 21:00:42,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d59baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:42, skipping insertion in model container [2025-03-03 21:00:42,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:41" (2/3) ... [2025-03-03 21:00:42,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d59baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:42, skipping insertion in model container [2025-03-03 21:00:42,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:42" (3/3) ... [2025-03-03 21:00:42,330 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-03 21:00:42,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:00:42,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:00:42,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:00:42,390 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;@6e84dd05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:00:42,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:00:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:00:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:00:42,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:42,401 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:42,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:42,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1670680911, now seen corresponding path program 1 times [2025-03-03 21:00:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894403621] [2025-03-03 21:00:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:42,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:00:42,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:00:42,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:42,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:00:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894403621] [2025-03-03 21:00:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894403621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:00:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871882877] [2025-03-03 21:00:42,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:42,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:00:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:00:42,635 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 21:00:42,636 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 21:00:42,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:00:42,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:00:42,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:42,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:42,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:00:42,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:00:42,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871882877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:00:42,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:00:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759341458] [2025-03-03 21:00:42,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:42,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:00:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:42,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:00:42,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:00:42,807 INFO L87 Difference]: Start difference. First operand has 93 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:00:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:42,829 INFO L93 Difference]: Finished difference Result 180 states and 305 transitions. [2025-03-03 21:00:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:00:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-03 21:00:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:42,835 INFO L225 Difference]: With dead ends: 180 [2025-03-03 21:00:42,835 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 21:00:42,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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 21:00:42,840 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:42,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:00:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 21:00:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 21:00:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:00:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2025-03-03 21:00:42,870 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 140 [2025-03-03 21:00:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:42,870 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2025-03-03 21:00:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:00:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2025-03-03 21:00:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:00:42,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:42,873 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:42,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:00:43,073 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 21:00:43,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash -9650605, now seen corresponding path program 1 times [2025-03-03 21:00:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:43,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039619496] [2025-03-03 21:00:43,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:00:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:00:43,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:43,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:00:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039619496] [2025-03-03 21:00:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039619496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:00:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560616416] [2025-03-03 21:00:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:43,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:00:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:00:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:00:43,416 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:43,671 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2025-03-03 21:00:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:00:43,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:00:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:43,675 INFO L225 Difference]: With dead ends: 320 [2025-03-03 21:00:43,676 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 21:00:43,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:00:43,678 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:43,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 463 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:00:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 21:00:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 228. [2025-03-03 21:00:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.5) internal successors, (270), 181 states have internal predecessors, (270), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:00:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 358 transitions. [2025-03-03 21:00:43,709 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 358 transitions. Word has length 140 [2025-03-03 21:00:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 358 transitions. [2025-03-03 21:00:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 358 transitions. [2025-03-03 21:00:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:00:43,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:43,712 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:00:43,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:43,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1806601964, now seen corresponding path program 1 times [2025-03-03 21:00:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231813440] [2025-03-03 21:00:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:43,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:43,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:00:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:00:43,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:43,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:00:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231813440] [2025-03-03 21:00:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231813440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:44,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:00:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659407242] [2025-03-03 21:00:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:00:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:44,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:00:44,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:00:44,072 INFO L87 Difference]: Start difference. First operand 228 states and 358 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:44,229 INFO L93 Difference]: Finished difference Result 622 states and 976 transitions. [2025-03-03 21:00:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:00:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 21:00:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:44,237 INFO L225 Difference]: With dead ends: 622 [2025-03-03 21:00:44,237 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 21:00:44,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:00:44,238 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 102 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:44,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 465 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:00:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 21:00:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 271. [2025-03-03 21:00:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 202 states have internal predecessors, (291), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:00:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2025-03-03 21:00:44,276 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 140 [2025-03-03 21:00:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:44,278 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2025-03-03 21:00:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2025-03-03 21:00:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:00:44,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:44,281 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:44,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:00:44,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 252538953, now seen corresponding path program 1 times [2025-03-03 21:00:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239450122] [2025-03-03 21:00:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:44,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:00:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:00:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:44,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:00:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239450122] [2025-03-03 21:00:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239450122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:00:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310067960] [2025-03-03 21:00:44,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:44,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:00:44,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:00:44,533 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 21:00:44,535 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 21:00:44,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:00:44,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:00:44,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:44,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:00:44,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 21:00:44,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:00:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:00:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310067960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:00:44,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:00:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 21:00:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957183911] [2025-03-03 21:00:44,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:00:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:00:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:00:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:00:44,874 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 21:00:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:45,089 INFO L93 Difference]: Finished difference Result 503 states and 766 transitions. [2025-03-03 21:00:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:00:45,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 141 [2025-03-03 21:00:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:45,092 INFO L225 Difference]: With dead ends: 503 [2025-03-03 21:00:45,092 INFO L226 Difference]: Without dead ends: 278 [2025-03-03 21:00:45,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:00:45,093 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 317 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:45,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 245 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:00:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-03 21:00:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2025-03-03 21:00:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 196 states have internal predecessors, (267), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:00:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 395 transitions. [2025-03-03 21:00:45,124 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 395 transitions. Word has length 141 [2025-03-03 21:00:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:45,125 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 395 transitions. [2025-03-03 21:00:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 21:00:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 395 transitions. [2025-03-03 21:00:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 21:00:45,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:45,128 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 21:00:45,332 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,SelfDestructingSolverStorable3 [2025-03-03 21:00:45,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 895070493, now seen corresponding path program 1 times [2025-03-03 21:00:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:45,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761226651] [2025-03-03 21:00:45,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:00:45,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:00:45,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:45,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:00:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504403251] [2025-03-03 21:00:45,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:00:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:00:45,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:00:45,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:00:45,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:00:45,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:00:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:00:45,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:00:45,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:00:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:00:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:00:45,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:00:45,620 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:00:45,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:00:45,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:00:45,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:00:45,825 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 21:00:45,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:00:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:00:45 BoogieIcfgContainer [2025-03-03 21:00:45,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:00:45,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:00:45,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:00:45,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:00:45,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:42" (3/4) ... [2025-03-03 21:00:45,918 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:00:45,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:00:45,919 INFO L158 Benchmark]: Toolchain (without parser) took 4436.48ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 109.4MB in the beginning and 73.5MB in the end (delta: 35.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-03-03 21:00:45,920 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:00:45,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.13ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 93.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:00:45,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.19ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:00:45,921 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:00:45,921 INFO L158 Benchmark]: IcfgBuilder took 514.18ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 53.6MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:00:45,922 INFO L158 Benchmark]: TraceAbstraction took 3589.54ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 53.2MB in the beginning and 73.5MB in the end (delta: -20.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2025-03-03 21:00:45,922 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 176.2MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 6.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:00:45,923 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.51ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.13ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 93.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.19ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 84.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 514.18ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 53.6MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3589.54ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 53.2MB in the beginning and 73.5MB in the end (delta: -20.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 176.2MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 6.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] signed short int var_1_23 = -10; [L41] unsigned long int var_1_30 = 1000000000; [L42] float var_1_33 = 99.25; [L43] signed long int var_1_34 = 10; [L44] unsigned char var_1_35 = 16; [L45] signed long int var_1_39 = -128; [L46] signed long int var_1_40 = 1792665454; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L169] last_1_var_1_8 = var_1_8 [L170] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L180] RET updateLastVariables() [L181] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] var_1_7 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] 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_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] 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_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] var_1_19 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] var_1_40 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L181] RET updateVariables() [L182] CALL step() [L52] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L53] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L54] COND TRUE \read(last_1_var_1_8) [L55] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND TRUE var_1_5 < var_1_3 [L61] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L65] COND TRUE \read(var_1_7) [L66] var_1_34 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L68] EXPR var_1_4 >> var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L68] COND FALSE !(var_1_4 > (var_1_4 >> var_1_4)) [L75] var_1_39 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L77] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L78] COND TRUE 128u <= var_1_19 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L79] COND FALSE !((var_1_12 >= var_1_12) && ((var_1_19 * var_1_15) < ((((var_1_1) < (var_1_19)) ? (var_1_1) : (var_1_19))))) [L90] var_1_23 = 5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L93] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L98] COND TRUE var_1_1 >= var_1_14 [L99] var_1_30 = (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) - var_1_2) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L101] COND TRUE var_1_19 > var_1_3 [L102] var_1_35 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L110] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L111] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L112] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L116] var_1_20 = ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13))) [L117] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L118] COND FALSE !(var_1_4 == stepLocal_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L121] var_1_33 = var_1_12 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L122] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L122] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L123] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L182] RET step() [L183] CALL, EXPR property() [L173] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L173-L174] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=-2147483649, var_1_19=-2147483648, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=-255, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=2, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 1309 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 479 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 141 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 976 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5255/5320 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 21:00:45,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:00:47,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:00:47,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:00:47,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:00:47,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:00:47,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:00:47,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:00:47,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:00:47,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:00:47,885 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:00:47,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:00:47,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:00:47,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:00:47,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:00:47,886 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:00:47,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:00:47,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:00:47,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:00:47,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:00:47,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:00:47,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:00:47,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:00:47,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:00:47,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:00:47,890 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2025-03-03 21:00:48,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:00:48,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:00:48,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:00:48,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:00:48,139 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:00:48,141 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-pr-ci_file-17.i [2025-03-03 21:00:49,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb7bf16a/58b611f9910349269274347e2aaf8f7f/FLAGeb3efd017 [2025-03-03 21:00:49,506 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:00:49,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-03 21:00:49,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb7bf16a/58b611f9910349269274347e2aaf8f7f/FLAGeb3efd017 [2025-03-03 21:00:49,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb7bf16a/58b611f9910349269274347e2aaf8f7f [2025-03-03 21:00:49,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:00:49,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:00:49,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:00:49,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:00:49,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:00:49,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ba5ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49, skipping insertion in model container [2025-03-03 21:00:49,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:00:49,667 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-pr-ci_file-17.i[919,932] [2025-03-03 21:00:49,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:00:49,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:00:49,754 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-pr-ci_file-17.i[919,932] [2025-03-03 21:00:49,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:00:49,810 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:00:49,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49 WrapperNode [2025-03-03 21:00:49,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:00:49,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:00:49,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:00:49,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:00:49,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,856 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-03 21:00:49,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:00:49,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:00:49,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:00:49,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:00:49,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,887 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 21:00:49,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:00:49,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:00:49,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:00:49,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:00:49,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (1/1) ... [2025-03-03 21:00:49,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:00:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:00:49,934 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 21:00:49,939 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 21:00:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:00:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:00:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:00:49,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:00:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:00:49,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:00:50,027 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:00:50,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:00:50,689 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:00:50,690 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:00:50,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:00:50,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:00:50,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:50 BoogieIcfgContainer [2025-03-03 21:00:50,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:00:50,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:00:50,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:00:50,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:00:50,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:00:49" (1/3) ... [2025-03-03 21:00:50,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a773ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:50, skipping insertion in model container [2025-03-03 21:00:50,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:00:49" (2/3) ... [2025-03-03 21:00:50,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a773ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:50, skipping insertion in model container [2025-03-03 21:00:50,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:50" (3/3) ... [2025-03-03 21:00:50,711 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2025-03-03 21:00:50,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:00:50,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:00:50,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:00:50,777 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;@132b83fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:00:50,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:00:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:00:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 21:00:50,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:50,793 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:50,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -829703, now seen corresponding path program 1 times [2025-03-03 21:00:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438000959] [2025-03-03 21:00:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:50,805 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 21:00:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:50,808 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 21:00:50,809 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 21:00:50,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 21:00:51,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 21:00:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:00:51,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:00:51,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:51,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438000959] [2025-03-03 21:00:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438000959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:00:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916836951] [2025-03-03 21:00:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:00:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:00:51,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:00:51,419 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:51,955 INFO L93 Difference]: Finished difference Result 211 states and 380 transitions. [2025-03-03 21:00:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:00:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-03-03 21:00:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:51,969 INFO L225 Difference]: With dead ends: 211 [2025-03-03 21:00:51,969 INFO L226 Difference]: Without dead ends: 140 [2025-03-03 21:00:51,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:00:51,974 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 70 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:51,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 366 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:00:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-03 21:00:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2025-03-03 21:00:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:00:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2025-03-03 21:00:52,039 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 135 [2025-03-03 21:00:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:52,040 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2025-03-03 21:00:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2025-03-03 21:00:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 21:00:52,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:52,044 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:52,053 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 21:00:52,245 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 21:00:52,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:52,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -227027706, now seen corresponding path program 1 times [2025-03-03 21:00:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941282733] [2025-03-03 21:00:52,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:52,246 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 21:00:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:52,248 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 21:00:52,249 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 21:00:52,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 21:00:52,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 21:00:52,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:52,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:52,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:00:52,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 21:00:52,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:00:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 21:00:52,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:52,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941282733] [2025-03-03 21:00:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941282733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:00:52,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:00:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-03 21:00:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765559164] [2025-03-03 21:00:52,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:00:52,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:00:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:52,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:00:52,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:00:52,711 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 21:00:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:53,222 INFO L93 Difference]: Finished difference Result 188 states and 283 transitions. [2025-03-03 21:00:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:00:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 136 [2025-03-03 21:00:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:53,233 INFO L225 Difference]: With dead ends: 188 [2025-03-03 21:00:53,233 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 21:00:53,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:00:53,234 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:53,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 185 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:00:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 21:00:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-03-03 21:00:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:00:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-03-03 21:00:53,250 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 136 [2025-03-03 21:00:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-03-03 21:00:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 21:00:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-03-03 21:00:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:00:53,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:53,253 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:53,261 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 21:00:53,457 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 21:00:53,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:53,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1951588410, now seen corresponding path program 1 times [2025-03-03 21:00:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:53,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211484634] [2025-03-03 21:00:53,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:53,458 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 21:00:53,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:53,460 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 21:00:53,461 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 21:00:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:00:53,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:00:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:53,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:00:53,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:00:53,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:53,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:53,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211484634] [2025-03-03 21:00:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211484634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:53,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:53,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:00:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800696905] [2025-03-03 21:00:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:00:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:53,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:00:53,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:00:53,873 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:54,169 INFO L93 Difference]: Finished difference Result 256 states and 379 transitions. [2025-03-03 21:00:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:00:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 21:00:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:54,171 INFO L225 Difference]: With dead ends: 256 [2025-03-03 21:00:54,172 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 21:00:54,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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 21:00:54,173 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:54,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:00:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 21:00:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2025-03-03 21:00:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 117 states have internal predecessors, (152), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:00:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2025-03-03 21:00:54,202 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 137 [2025-03-03 21:00:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:54,203 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2025-03-03 21:00:54,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2025-03-03 21:00:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:00:54,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:54,204 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:54,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:00:54,409 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 21:00:54,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:54,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1822505691, now seen corresponding path program 1 times [2025-03-03 21:00:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:54,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693389042] [2025-03-03 21:00:54,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:54,411 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 21:00:54,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:54,412 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 21:00:54,413 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 21:00:54,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:00:54,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:00:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:54,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:00:54,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 309 proven. 42 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-03 21:00:55,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:00:55,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693389042] [2025-03-03 21:00:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693389042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:00:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671185761] [2025-03-03 21:00:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:00:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:00:55,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:00:55,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 21:00:55,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:00:55,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:00:55,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:55,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:55,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:00:55,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:00:56,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [671185761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:56,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:00:56,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2025-03-03 21:00:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513389874] [2025-03-03 21:00:56,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:56,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:00:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:56,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:00:56,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:00:56,045 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:56,903 INFO L93 Difference]: Finished difference Result 363 states and 532 transitions. [2025-03-03 21:00:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:00:56,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 21:00:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:56,905 INFO L225 Difference]: With dead ends: 363 [2025-03-03 21:00:56,906 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 21:00:56,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:00:56,907 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 337 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:00:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 21:00:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2025-03-03 21:00:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 148 states have internal predecessors, (191), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 21:00:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-03-03 21:00:56,927 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 137 [2025-03-03 21:00:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:56,927 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-03-03 21:00:56,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:00:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-03-03 21:00:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:00:56,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:56,928 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:00:56,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 21:00:57,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-03 21:00:57,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:00:57,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:57,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1584957924, now seen corresponding path program 1 times [2025-03-03 21:00:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582120436] [2025-03-03 21:00:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:57,334 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 21:00:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:57,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:00:57,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 21:00:57,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:00:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:00:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 21:00:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates...