./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-61.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_dependencies_file-61.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 e8ce12979d8ad67f0c73a2a1e5d1d9d06850e25bebeafffbe3d0d7df33e4393e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:39:55,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:39:55,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:39:55,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:39:55,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:39:55,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:39:55,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:39:55,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:39:55,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:39:55,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:39:55,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:39:55,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:39:55,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:39:55,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:39:55,511 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:39:55,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:39:55,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:39:55,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:39:55,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:39:55,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:39:55,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:39:55,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:39:55,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:39:55,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:39:55,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:39:55,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:39:55,514 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 -> e8ce12979d8ad67f0c73a2a1e5d1d9d06850e25bebeafffbe3d0d7df33e4393e [2025-03-03 18:39:55,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:39:55,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:39:55,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:39:55,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:39:55,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:39:55,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-61.i [2025-03-03 18:39:56,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23180a1e/f83dc3f37ff4470f89076220169f5368/FLAG9bac77932 [2025-03-03 18:39:57,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:39:57,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-61.i [2025-03-03 18:39:57,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23180a1e/f83dc3f37ff4470f89076220169f5368/FLAG9bac77932 [2025-03-03 18:39:57,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23180a1e/f83dc3f37ff4470f89076220169f5368 [2025-03-03 18:39:57,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:39:57,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:39:57,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:39:57,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:39:57,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:39:57,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174e698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57, skipping insertion in model container [2025-03-03 18:39:57,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:39:57,261 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_dependencies_file-61.i[919,932] [2025-03-03 18:39:57,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:39:57,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:39:57,329 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_dependencies_file-61.i[919,932] [2025-03-03 18:39:57,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:39:57,363 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:39:57,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57 WrapperNode [2025-03-03 18:39:57,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:39:57,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:39:57,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:39:57,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:39:57,369 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:39:57" (1/1) ... [2025-03-03 18:39:57,376 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:39:57" (1/1) ... [2025-03-03 18:39:57,397 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-03-03 18:39:57,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:39:57,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:39:57,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:39:57,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:39:57,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,421 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:39:57,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:39:57,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:39:57,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:39:57,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:39:57,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (1/1) ... [2025-03-03 18:39:57,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:39:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:57,461 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:39:57,463 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:39:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:39:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:39:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:39:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:39:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:39:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:39:57,529 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:39:57,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:39:57,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~ite17#1;havoc property_#t~ite16#1;havoc property_#t~bitwise15#1;havoc property_#t~short18#1; [2025-03-03 18:39:57,769 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 18:39:57,771 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:39:57,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:39:57,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:39:57,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:57 BoogieIcfgContainer [2025-03-03 18:39:57,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:39:57,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:39:57,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:39:57,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:39:57,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:39:57" (1/3) ... [2025-03-03 18:39:57,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ea64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:39:57, skipping insertion in model container [2025-03-03 18:39:57,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:57" (2/3) ... [2025-03-03 18:39:57,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ea64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:39:57, skipping insertion in model container [2025-03-03 18:39:57,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:57" (3/3) ... [2025-03-03 18:39:57,797 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-61.i [2025-03-03 18:39:57,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:39:57,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-61.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:39:57,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:39:57,862 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;@6da9f518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:39:57,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:39:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:39:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 18:39:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:57,874 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:57,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1181311529, now seen corresponding path program 1 times [2025-03-03 18:39:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384535410] [2025-03-03 18:39:57,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:57,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:39:57,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:39:57,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:57,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 18:39:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:58,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384535410] [2025-03-03 18:39:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384535410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:39:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940714264] [2025-03-03 18:39:58,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:39:58,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:58,149 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:39:58,151 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:39:58,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:39:58,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:39:58,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:58,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:58,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:39:58,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:39:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 18:39:58,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:39:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940714264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:39:58,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:39:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:39:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291660707] [2025-03-03 18:39:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:39:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:39:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:39:58,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:39:58,328 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:39:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:39:58,358 INFO L93 Difference]: Finished difference Result 144 states and 247 transitions. [2025-03-03 18:39:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:39:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-03 18:39:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:39:58,366 INFO L225 Difference]: With dead ends: 144 [2025-03-03 18:39:58,367 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 18:39:58,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:39:58,371 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:39:58,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:39:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 18:39:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 18:39:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:39:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2025-03-03 18:39:58,402 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 129 [2025-03-03 18:39:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:39:58,403 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2025-03-03 18:39:58,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:39:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2025-03-03 18:39:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 18:39:58,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:58,409 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:58,415 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:39:58,609 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:39:58,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:58,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2103711670, now seen corresponding path program 1 times [2025-03-03 18:39:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100726120] [2025-03-03 18:39:58,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:39:58,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:39:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:39:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100726120] [2025-03-03 18:39:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100726120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:39:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:39:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:39:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153833630] [2025-03-03 18:39:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:39:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:39:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:58,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:39:58,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:39:58,964 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:39:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:39:58,996 INFO L93 Difference]: Finished difference Result 141 states and 213 transitions. [2025-03-03 18:39:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:39:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-03 18:39:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:39:59,000 INFO L225 Difference]: With dead ends: 141 [2025-03-03 18:39:59,000 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 18:39:59,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:39:59,001 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:39:59,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:39:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 18:39:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 18:39:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:39:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2025-03-03 18:39:59,010 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 129 [2025-03-03 18:39:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:39:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2025-03-03 18:39:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:39:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2025-03-03 18:39:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 18:39:59,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:59,013 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:39:59,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2062172907, now seen corresponding path program 1 times [2025-03-03 18:39:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429955016] [2025-03-03 18:39:59,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:39:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:39:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 18:39:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429955016] [2025-03-03 18:39:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429955016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:39:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227354554] [2025-03-03 18:39:59,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:59,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:39:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:59,458 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:39:59,459 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:39:59,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:39:59,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:39:59,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:59,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:59,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 18:39:59,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:39:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 365 proven. 30 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 18:39:59,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:39:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 18:39:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227354554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:39:59,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:39:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-03 18:39:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933356420] [2025-03-03 18:39:59,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:39:59,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:39:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:59,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:39:59,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:39:59,900 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 18:40:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:00,761 INFO L93 Difference]: Finished difference Result 340 states and 482 transitions. [2025-03-03 18:40:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 18:40:00,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 129 [2025-03-03 18:40:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:00,764 INFO L225 Difference]: With dead ends: 340 [2025-03-03 18:40:00,764 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 18:40:00,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=446, Invalid=1276, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 18:40:00,766 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 562 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:00,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 483 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:40:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 18:40:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 145. [2025-03-03 18:40:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 98 states have internal predecessors, (122), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 18:40:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2025-03-03 18:40:00,812 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 129 [2025-03-03 18:40:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:00,814 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2025-03-03 18:40:00,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 18:40:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2025-03-03 18:40:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 18:40:00,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:00,817 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:00,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:40:01,022 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,SelfDestructingSolverStorable2 [2025-03-03 18:40:01,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1345290708, now seen corresponding path program 1 times [2025-03-03 18:40:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156271985] [2025-03-03 18:40:01,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:01,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:40:01,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:40:01,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:01,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:40:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299024766] [2025-03-03 18:40:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:01,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:40:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:40:01,090 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:40:01,092 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:40:01,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:40:01,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:40:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:40:01,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:40:01,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 18:40:01,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 18:40:01,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:01,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:40:01,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:40:01,331 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:40:01,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:40:01,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:40:01,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:40:01,536 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 18:40:01,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:40:01,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:40:01 BoogieIcfgContainer [2025-03-03 18:40:01,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:40:01,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:40:01,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:40:01,600 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:40:01,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:57" (3/4) ... [2025-03-03 18:40:01,602 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:40:01,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:40:01,604 INFO L158 Benchmark]: Toolchain (without parser) took 4481.08ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 84.7MB in the end (delta: 47.8MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-03-03 18:40:01,604 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:40:01,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.91ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:40:01,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:40:01,605 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:40:01,605 INFO L158 Benchmark]: IcfgBuilder took 358.65ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 92.6MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:40:01,606 INFO L158 Benchmark]: TraceAbstraction took 3808.69ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 84.8MB in the end (delta: 6.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2025-03-03 18:40:01,606 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:40:01,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.91ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.65ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 92.6MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3808.69ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 84.8MB in the end (delta: 6.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 50.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L88] var_1_5 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L90] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L90] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L91] var_1_6 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L93] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L93] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L94] var_1_8 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L95] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L96] var_1_14 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L97] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L98] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L98] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L99] var_1_15 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L100] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L101] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L101] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L102] var_1_16 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L103] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L104] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L104] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L105] var_1_17 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L106] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L107] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L107] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L108] var_1_18 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L109] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L110] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L110] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L111] var_1_20 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L112] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L113] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L113] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L114] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L114] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L115] var_1_23 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L116] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L117] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L117] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L131] RET updateVariables() [L132] CALL step() [L44] COND FALSE !(last_1_var_1_9 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L47] var_1_21 = var_1_6 [L48] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L49] COND FALSE !(var_1_4 >= (4256310412u - 128u)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L52] COND TRUE (var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4 [L53] var_1_1 = (8.8 - 255.2) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=79/5, var_1_9=-50] [L55] COND FALSE !(var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) [L64] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L66] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L73] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L75] COND TRUE ((var_1_22 / 2) / var_1_20) >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L76] COND TRUE \read(var_1_13) [L77] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L123-L124] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_20=2, var_1_21=64, var_1_22=-126, var_1_23=-126, var_1_4=1, var_1_5=-4294967232, var_1_6=64, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 647 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 632 mSDsluCounter, 689 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 434 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 310 mSDtfsCounter, 434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 126 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 903 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448 SizeOfPredicates, 1 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4456/4560 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:40:01,626 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_dependencies_file-61.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 e8ce12979d8ad67f0c73a2a1e5d1d9d06850e25bebeafffbe3d0d7df33e4393e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:40:03,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:40:03,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:40:03,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:40:03,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:40:03,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:40:03,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:40:03,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:40:03,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:40:03,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:40:03,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:40:03,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:40:03,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:40:03,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:40:03,527 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:40:03,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:40:03,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:40:03,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:40:03,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:40:03,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:40:03,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:40:03,530 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 -> e8ce12979d8ad67f0c73a2a1e5d1d9d06850e25bebeafffbe3d0d7df33e4393e [2025-03-03 18:40:03,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:40:03,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:40:03,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:40:03,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:40:03,788 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:40:03,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-61.i [2025-03-03 18:40:05,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4392a7e09/72550812f97d49c5947c9ad47489662b/FLAG7eabfc07a [2025-03-03 18:40:05,245 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:40:05,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-61.i [2025-03-03 18:40:05,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4392a7e09/72550812f97d49c5947c9ad47489662b/FLAG7eabfc07a [2025-03-03 18:40:05,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4392a7e09/72550812f97d49c5947c9ad47489662b [2025-03-03 18:40:05,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:40:05,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:40:05,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:40:05,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:40:05,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:40:05,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05, skipping insertion in model container [2025-03-03 18:40:05,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:40:05,423 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_dependencies_file-61.i[919,932] [2025-03-03 18:40:05,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:40:05,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:40:05,496 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_dependencies_file-61.i[919,932] [2025-03-03 18:40:05,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:40:05,529 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:40:05,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05 WrapperNode [2025-03-03 18:40:05,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:40:05,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:40:05,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:40:05,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:40:05,536 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:40:05" (1/1) ... [2025-03-03 18:40:05,550 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:40:05" (1/1) ... [2025-03-03 18:40:05,566 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-03 18:40:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:40:05,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:40:05,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:40:05,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:40:05,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,593 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:40:05,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:40:05,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:40:05,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:40:05,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:40:05,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (1/1) ... [2025-03-03 18:40:05,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:40:05,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:40:05,638 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:40:05,641 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:40:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:40:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:40:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:40:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:40:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:40:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:40:05,711 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:40:05,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:40:06,130 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:40:06,130 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:40:06,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:40:06,141 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:40:06,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:40:06 BoogieIcfgContainer [2025-03-03 18:40:06,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:40:06,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:40:06,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:40:06,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:40:06,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:40:05" (1/3) ... [2025-03-03 18:40:06,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5054fae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:40:06, skipping insertion in model container [2025-03-03 18:40:06,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:05" (2/3) ... [2025-03-03 18:40:06,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5054fae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:40:06, skipping insertion in model container [2025-03-03 18:40:06,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:40:06" (3/3) ... [2025-03-03 18:40:06,150 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-61.i [2025-03-03 18:40:06,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:40:06,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-61.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:40:06,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:40:06,204 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;@62ccd3a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:40:06,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:40:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:40:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:40:06,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:06,214 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:06,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:06,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash -191797499, now seen corresponding path program 1 times [2025-03-03 18:40:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:40:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053417662] [2025-03-03 18:40:06,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:06,225 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:40:06,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:40:06,227 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:40:06,228 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:40:06,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:40:06,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:40:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:06,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:06,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:40:06,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:40:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-03 18:40:06,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:40:06,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:40:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053417662] [2025-03-03 18:40:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053417662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:40:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:40:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839757868] [2025-03-03 18:40:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:40:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:40:06,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:40:06,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:40:06,510 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:40:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:06,524 INFO L93 Difference]: Finished difference Result 113 states and 197 transitions. [2025-03-03 18:40:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:40:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2025-03-03 18:40:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:06,530 INFO L225 Difference]: With dead ends: 113 [2025-03-03 18:40:06,530 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 18:40:06,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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:40:06,533 INFO L435 NwaCegarLoop]: 83 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, 83 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:40:06,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:40:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 18:40:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 18:40:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:40:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 18:40:06,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 127 [2025-03-03 18:40:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:06,559 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 18:40:06,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:40:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 18:40:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:40:06,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:06,561 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:06,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 18:40:06,762 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:40:06,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:06,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash 182570148, now seen corresponding path program 1 times [2025-03-03 18:40:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:40:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40123374] [2025-03-03 18:40:06,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:06,764 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:40:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:40:06,770 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:40:06,771 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:40:06,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:40:06,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:40:06,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:06,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 18:40:06,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:40:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:40:07,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:40:07,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:40:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40123374] [2025-03-03 18:40:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40123374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:40:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:40:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047008701] [2025-03-03 18:40:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:07,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:40:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:40:07,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:40:07,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:40:07,352 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:40:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:07,507 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2025-03-03 18:40:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:40:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-03 18:40:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:07,521 INFO L225 Difference]: With dead ends: 109 [2025-03-03 18:40:07,521 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 18:40:07,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:40:07,522 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:07,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:40:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 18:40:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 18:40:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:40:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2025-03-03 18:40:07,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 127 [2025-03-03 18:40:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2025-03-03 18:40:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:40:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2025-03-03 18:40:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:40:07,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:07,534 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:07,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:40:07,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:40:07,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:07,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash -13943357, now seen corresponding path program 1 times [2025-03-03 18:40:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:40:07,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605450732] [2025-03-03 18:40:07,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:07,737 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:40:07,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:40:07,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:40:07,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:40:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:40:07,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:40:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:07,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 18:40:07,919 INFO L279 TraceCheckSpWp]: Computing forward predicates...