./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.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_codestructure_normal_file-41.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 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:50:08,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:50:08,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:50:08,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:50:08,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:50:08,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:50:08,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:50:08,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:50:08,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:50:08,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:50:08,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:50:08,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:50:08,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:50:08,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:50:08,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:50:08,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:50:08,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:50:08,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:50:08,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:50:08,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:50:08,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:50:08,904 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 -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2025-03-03 18:50:09,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:50:09,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:50:09,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:50:09,122 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:50:09,122 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:50:09,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2025-03-03 18:50:10,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ba8348/09c81edbb2a7405f892c16daa83d5a16/FLAG0c4005a56 [2025-03-03 18:50:10,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:50:10,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2025-03-03 18:50:10,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ba8348/09c81edbb2a7405f892c16daa83d5a16/FLAG0c4005a56 [2025-03-03 18:50:10,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4ba8348/09c81edbb2a7405f892c16daa83d5a16 [2025-03-03 18:50:10,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:50:10,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:50:10,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:50:10,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:50:10,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:50:10,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:50:10" (1/1) ... [2025-03-03 18:50:10,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216d678a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:10, skipping insertion in model container [2025-03-03 18:50:10,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:50:10" (1/1) ... [2025-03-03 18:50:10,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:50:10,940 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_codestructure_normal_file-41.i[913,926] [2025-03-03 18:50:10,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:50:11,012 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:50:11,021 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_codestructure_normal_file-41.i[913,926] [2025-03-03 18:50:11,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:50:11,068 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:50:11,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11 WrapperNode [2025-03-03 18:50:11,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:50:11,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:50:11,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:50:11,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:50:11,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,119 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-03 18:50:11,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:50:11,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:50:11,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:50:11,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:50:11,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,155 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 18:50:11,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:50:11,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:50:11,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:50:11,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:50:11,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (1/1) ... [2025-03-03 18:50:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:50:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:50:11,199 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 18:50:11,204 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 18:50:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:50:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:50:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:50:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:50:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:50:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:50:11,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:50:11,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:50:11,554 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:50:11,554 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:50:11,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:50:11,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:50:11,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:50:11 BoogieIcfgContainer [2025-03-03 18:50:11,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:50:11,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:50:11,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:50:11,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:50:11,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:50:10" (1/3) ... [2025-03-03 18:50:11,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e828826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:50:11, skipping insertion in model container [2025-03-03 18:50:11,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:11" (2/3) ... [2025-03-03 18:50:11,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e828826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:50:11, skipping insertion in model container [2025-03-03 18:50:11,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:50:11" (3/3) ... [2025-03-03 18:50:11,576 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2025-03-03 18:50:11,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:50:11,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-41.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:50:11,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:50:11,627 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;@33355081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:50:11,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:50:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 18:50:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:50:11,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:11,637 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:11,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:11,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -281373966, now seen corresponding path program 1 times [2025-03-03 18:50:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331736738] [2025-03-03 18:50:11,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:11,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:11,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 18:50:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331736738] [2025-03-03 18:50:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331736738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:50:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021749714] [2025-03-03 18:50:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:50:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:50:11,877 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 18:50:11,878 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 18:50:11,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:11,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:50:11,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:50:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 18:50:12,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:50:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021749714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:50:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:50:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558409946] [2025-03-03 18:50:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:50:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:12,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:50:12,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:50:12,057 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 18:50:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:12,081 INFO L93 Difference]: Finished difference Result 130 states and 228 transitions. [2025-03-03 18:50:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:50:12,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 156 [2025-03-03 18:50:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:12,088 INFO L225 Difference]: With dead ends: 130 [2025-03-03 18:50:12,089 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 18:50:12,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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 18:50:12,096 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:12,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:50:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 18:50:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 18:50:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 18:50:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2025-03-03 18:50:12,131 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 156 [2025-03-03 18:50:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:12,131 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2025-03-03 18:50:12,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 18:50:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2025-03-03 18:50:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:50:12,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:12,134 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:12,141 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 18:50:12,338 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 18:50:12,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:12,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1418008367, now seen corresponding path program 1 times [2025-03-03 18:50:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:12,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278688452] [2025-03-03 18:50:12,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:12,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:12,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:12,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:12,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:50:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146604166] [2025-03-03 18:50:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:50:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:50:12,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 18:50:12,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 18:50:12,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:12,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 18:50:12,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:50:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-03 18:50:13,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:50:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278688452] [2025-03-03 18:50:16,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:50:16,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146604166] [2025-03-03 18:50:16,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146604166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:50:16,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:50:16,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-03 18:50:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611189716] [2025-03-03 18:50:16,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:50:16,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:50:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:16,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:50:16,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:50:16,332 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-03 18:50:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:16,918 INFO L93 Difference]: Finished difference Result 202 states and 285 transitions. [2025-03-03 18:50:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 18:50:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 156 [2025-03-03 18:50:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:16,920 INFO L225 Difference]: With dead ends: 202 [2025-03-03 18:50:16,920 INFO L226 Difference]: Without dead ends: 140 [2025-03-03 18:50:16,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2025-03-03 18:50:16,921 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 143 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:16,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 319 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:50:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-03 18:50:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2025-03-03 18:50:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 72 states have internal predecessors, (83), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 18:50:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2025-03-03 18:50:16,936 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 156 [2025-03-03 18:50:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2025-03-03 18:50:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-03 18:50:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2025-03-03 18:50:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 18:50:16,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:16,938 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:16,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:50:17,140 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,SelfDestructingSolverStorable1 [2025-03-03 18:50:17,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:17,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1712167990, now seen corresponding path program 1 times [2025-03-03 18:50:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261005829] [2025-03-03 18:50:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:17,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 18:50:17,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 18:50:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:50:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262071276] [2025-03-03 18:50:17,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:50:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:50:17,246 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 18:50:17,259 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 18:50:17,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 18:50:17,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 18:50:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:17,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:50:17,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:50:17,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 18:50:17,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 18:50:17,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:17,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:50:17,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:50:17,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:50:17,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:50:17,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:50:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:50:17,930 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 18:50:17,984 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:50:17,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:50:17 BoogieIcfgContainer [2025-03-03 18:50:17,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:50:17,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:50:17,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:50:17,987 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:50:17,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:50:11" (3/4) ... [2025-03-03 18:50:17,988 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:50:17,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:50:17,989 INFO L158 Benchmark]: Toolchain (without parser) took 7169.63ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 100.1MB in the end (delta: 20.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-03-03 18:50:17,989 INFO L158 Benchmark]: CDTParser took 2.10ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.85ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 105.5MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.89ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: IcfgBuilder took 392.95ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 75.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: TraceAbstraction took 6416.06ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 100.1MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:50:17,990 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:50:17,991 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.10ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.85ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 105.5MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.89ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 392.95ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 75.0MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6416.06ms. Allocated memory is still 167.8MB. Free memory was 75.0MB in the beginning and 100.1MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 100.25; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 4.8; [L29] signed char var_1_8 = 64; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 0; [L32] signed char var_1_11 = -10; [L33] signed char var_1_12 = 64; [L34] float var_1_13 = 1.6; [L35] float var_1_14 = 3.5; [L36] unsigned char var_1_15 = 8; [L37] unsigned char var_1_16 = 4; [L38] unsigned short int var_1_17 = 2; [L39] unsigned short int var_1_18 = 10000; [L40] unsigned short int var_1_19 = 5; [L41] signed short int var_1_20 = 4; [L42] unsigned long int var_1_21 = 5; [L43] signed char var_1_22 = -32; [L44] unsigned long int var_1_23 = 0; VAL [isInitial=0, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_2=401/4, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L90] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] var_1_5 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] var_1_11 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] var_1_12 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] var_1_16 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] var_1_18 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] var_1_19 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] var_1_21 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET updateVariables() [L141] CALL step() [L48] COND FALSE !((- var_1_2) > 31.9f) [L51] var_1_1 = var_1_5 VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L53] COND FALSE !((127.35 + var_1_2) <= var_1_7) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] COND TRUE var_1_9 > var_1_10 [L59] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L61] COND FALSE !((! var_1_5) || (var_1_12 < var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L68] COND TRUE \read(var_1_3) [L69] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_3 || (var_1_9 < var_1_15) [L72] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L76] COND FALSE !(((var_1_17 / var_1_18) * var_1_19) < -10) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L79] COND TRUE ! (var_1_21 <= var_1_10) [L80] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L85] var_1_22 = 1 [L86] var_1_23 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return ((((((((((- var_1_2) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_3 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_2) <= var_1_7) ? ((4.5 <= (var_1_7 * var_1_2)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_9 > var_1_10) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < var_1_8)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_3 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_3 || (var_1_9 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_17 / var_1_18) * var_1_19) < -10) ? (var_1_20 == ((signed short int) ((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))))) : ((! (var_1_21 <= var_1_10)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=0, var_1_16=0, var_1_17=8192, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 418 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 200 mSDtfsCounter, 442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 1144 SizeOfPredicates, 5 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 3519/3600 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 18:50:18,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.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 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:50:19,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:50:19,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:50:19,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:50:19,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:50:19,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:50:19,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:50:19,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:50:19,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:50:19,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:50:19,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:50:19,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:50:19,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:50:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:50:19,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:50:19,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:50:19,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:50:19,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:50:19,925 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 -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2025-03-03 18:50:20,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:50:20,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:50:20,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:50:20,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:50:20,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:50:20,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2025-03-03 18:50:21,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36645c6c/eed851d36acb4ed1a9ca68e80debbbf8/FLAG50fbee808 [2025-03-03 18:50:21,494 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:50:21,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2025-03-03 18:50:21,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36645c6c/eed851d36acb4ed1a9ca68e80debbbf8/FLAG50fbee808 [2025-03-03 18:50:21,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36645c6c/eed851d36acb4ed1a9ca68e80debbbf8 [2025-03-03 18:50:21,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:50:21,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:50:21,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:50:21,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:50:21,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:50:21,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:50:21" (1/1) ... [2025-03-03 18:50:21,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625c5318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:21, skipping insertion in model container [2025-03-03 18:50:21,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:50:21" (1/1) ... [2025-03-03 18:50:21,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:50:21,977 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_codestructure_normal_file-41.i[913,926] [2025-03-03 18:50:22,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:50:22,022 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:50:22,033 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_codestructure_normal_file-41.i[913,926] [2025-03-03 18:50:22,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:50:22,066 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:50:22,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22 WrapperNode [2025-03-03 18:50:22,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:50:22,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:50:22,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:50:22,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:50:22,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,096 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-03 18:50:22,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:50:22,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:50:22,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:50:22,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:50:22,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,116 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 18:50:22,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:50:22,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:50:22,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:50:22,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:50:22,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (1/1) ... [2025-03-03 18:50:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:50:22,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:50:22,161 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 18:50:22,164 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 18:50:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:50:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:50:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:50:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:50:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:50:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:50:22,255 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:50:22,257 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:50:34,799 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:50:34,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:50:34,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:50:34,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:50:34,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:50:34 BoogieIcfgContainer [2025-03-03 18:50:34,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:50:34,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:50:34,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:50:34,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:50:34,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:50:21" (1/3) ... [2025-03-03 18:50:34,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a02d362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:50:34, skipping insertion in model container [2025-03-03 18:50:34,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:50:22" (2/3) ... [2025-03-03 18:50:34,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a02d362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:50:34, skipping insertion in model container [2025-03-03 18:50:34,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:50:34" (3/3) ... [2025-03-03 18:50:34,832 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2025-03-03 18:50:34,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:50:34,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-41.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:50:34,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:50:34,890 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;@12721a6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:50:34,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:50:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 18:50:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:50:34,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:34,902 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:34,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:34,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash -281373966, now seen corresponding path program 1 times [2025-03-03 18:50:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:50:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661462132] [2025-03-03 18:50:34,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:34,913 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 18:50:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:50:34,915 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 18:50:34,916 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 18:50:34,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:35,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:35,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:35,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:50:35,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:50:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2025-03-03 18:50:35,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:50:35,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:50:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661462132] [2025-03-03 18:50:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661462132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:50:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:50:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009539929] [2025-03-03 18:50:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:50:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:50:35,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:50:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:50:35,325 INFO L87 Difference]: Start difference. First operand has 68 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 18:50:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:35,345 INFO L93 Difference]: Finished difference Result 130 states and 228 transitions. [2025-03-03 18:50:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:50:35,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 156 [2025-03-03 18:50:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:35,351 INFO L225 Difference]: With dead ends: 130 [2025-03-03 18:50:35,351 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 18:50:35,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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 18:50:35,355 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:35,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:50:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 18:50:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 18:50:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 18:50:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2025-03-03 18:50:35,395 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 156 [2025-03-03 18:50:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:35,396 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2025-03-03 18:50:35,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 18:50:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2025-03-03 18:50:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:50:35,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:35,399 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:35,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:50:35,600 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 18:50:35,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1418008367, now seen corresponding path program 1 times [2025-03-03 18:50:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:50:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963314343] [2025-03-03 18:50:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:35,602 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 18:50:35,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:50:35,604 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 18:50:35,606 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 18:50:35,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:50:35,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:50:35,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:35,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:35,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 18:50:35,945 INFO L279 TraceCheckSpWp]: Computing forward predicates...