./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:28:43,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:28:43,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:28:43,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:28:43,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:28:43,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:28:43,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:28:43,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:28:43,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:28:43,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:28:43,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:28:43,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:28:43,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:28:43,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:28:43,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:28:43,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:43,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:43,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:43,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:28:43,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:28:43,812 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-jdk21/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 -> 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d [2025-01-09 08:28:44,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:28:44,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:28:44,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:28:44,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:28:44,038 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:28:44,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:45,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c0a485d/5a5bdaa9ef8340a0adb29e78797758c7/FLAG5a76dbf07 [2025-01-09 08:28:45,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:28:45,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:45,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c0a485d/5a5bdaa9ef8340a0adb29e78797758c7/FLAG5a76dbf07 [2025-01-09 08:28:45,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c0a485d/5a5bdaa9ef8340a0adb29e78797758c7 [2025-01-09 08:28:45,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:28:45,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:28:45,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:45,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:28:45,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:28:45,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58276045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45, skipping insertion in model container [2025-01-09 08:28:45,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:28:45,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i[919,932] [2025-01-09 08:28:45,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:45,658 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:28:45,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i[919,932] [2025-01-09 08:28:45,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:45,704 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:28:45,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45 WrapperNode [2025-01-09 08:28:45,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:45,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:45,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:28:45,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:28:45,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,743 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 08:28:45,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:45,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:28:45,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:28:45,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:28:45,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,764 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-01-09 08:28:45,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:28:45,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:28:45,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:28:45,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:28:45,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (1/1) ... [2025-01-09 08:28:45,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:45,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:28:45,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:28:45,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:28:45,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:28:45,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:28:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:28:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:28:45,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:28:45,894 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:28:45,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:28:46,096 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 08:28:46,097 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:28:46,105 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:28:46,106 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:28:46,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:46 BoogieIcfgContainer [2025-01-09 08:28:46,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:28:46,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:28:46,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:28:46,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:28:46,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:28:45" (1/3) ... [2025-01-09 08:28:46,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639cd36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:46, skipping insertion in model container [2025-01-09 08:28:46,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:45" (2/3) ... [2025-01-09 08:28:46,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639cd36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:46, skipping insertion in model container [2025-01-09 08:28:46,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:46" (3/3) ... [2025-01-09 08:28:46,118 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:46,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:28:46,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-49.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:28:46,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:28:46,214 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;@6f5b76b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:28:46,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:28:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:28:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 08:28:46,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:46,230 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:46,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1295368074, now seen corresponding path program 1 times [2025-01-09 08:28:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166683156] [2025-01-09 08:28:46,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 08:28:46,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 08:28:46,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:46,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 08:28:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166683156] [2025-01-09 08:28:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166683156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:28:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318270310] [2025-01-09 08:28:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:46,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:46,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:28:46,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:28:46,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 08:28:46,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 08:28:46,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:46,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:46,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:28:46,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 08:28:46,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:28:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318270310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:28:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:28:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349094346] [2025-01-09 08:28:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:46,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:28:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:46,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:28:46,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:28:46,657 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:28:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:46,676 INFO L93 Difference]: Finished difference Result 135 states and 230 transitions. [2025-01-09 08:28:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:28:46,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 08:28:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:46,686 INFO L225 Difference]: With dead ends: 135 [2025-01-09 08:28:46,686 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 08:28:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-01-09 08:28:46,695 INFO L435 NwaCegarLoop]: 100 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, 100 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-01-09 08:28:46,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 08:28:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 08:28:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:28:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-01-09 08:28:46,755 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 135 [2025-01-09 08:28:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:46,756 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-01-09 08:28:46,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:28:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-01-09 08:28:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 08:28:46,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:46,759 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:46,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:28:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 08:28:46,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 762602176, now seen corresponding path program 1 times [2025-01-09 08:28:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-01-09 08:28:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:46,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 08:28:47,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 08:28:47,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:47,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:28:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692977703] [2025-01-09 08:28:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692977703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:47,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:47,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:28:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970520883] [2025-01-09 08:28:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:47,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:28:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:47,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:28:47,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:28:47,600 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:47,778 INFO L93 Difference]: Finished difference Result 195 states and 293 transitions. [2025-01-09 08:28:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:28:47,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-01-09 08:28:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:47,780 INFO L225 Difference]: With dead ends: 195 [2025-01-09 08:28:47,780 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 08:28:47,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:28:47,781 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:47,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:28:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 08:28:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2025-01-09 08:28:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 65 states have internal predecessors, (81), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:28:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 165 transitions. [2025-01-09 08:28:47,819 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 165 transitions. Word has length 135 [2025-01-09 08:28:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 165 transitions. [2025-01-09 08:28:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 165 transitions. [2025-01-09 08:28:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 08:28:47,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:47,823 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:28:47,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:47,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash -557409492, now seen corresponding path program 1 times [2025-01-09 08:28:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:47,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688376149] [2025-01-09 08:28:47,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:47,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 08:28:47,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 08:28:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:47,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:28:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688376149] [2025-01-09 08:28:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688376149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:28:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038594557] [2025-01-09 08:28:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:28:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:48,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:28:48,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:28:48,070 INFO L87 Difference]: Start difference. First operand 110 states and 165 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:48,118 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2025-01-09 08:28:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:28:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-01-09 08:28:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:48,123 INFO L225 Difference]: With dead ends: 175 [2025-01-09 08:28:48,123 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 08:28:48,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:28:48,124 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 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-01-09 08:28:48,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 08:28:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 08:28:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:28:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 166 transitions. [2025-01-09 08:28:48,136 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 166 transitions. Word has length 136 [2025-01-09 08:28:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:48,136 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 166 transitions. [2025-01-09 08:28:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 166 transitions. [2025-01-09 08:28:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 08:28:48,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:48,138 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:28:48,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1256078651, now seen corresponding path program 1 times [2025-01-09 08:28:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464821773] [2025-01-09 08:28:48,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:48,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 08:28:48,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 08:28:48,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:48,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:28:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464821773] [2025-01-09 08:28:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464821773] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:28:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167545442] [2025-01-09 08:28:48,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:48,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:28:48,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:28:48,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 08:28:48,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 08:28:48,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:48,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:48,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 08:28:48,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-01-09 08:28:49,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:28:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 08:28:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167545442] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:28:49,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:28:49,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2025-01-09 08:28:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593673970] [2025-01-09 08:28:49,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:28:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 08:28:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:49,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 08:28:49,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:28:49,914 INFO L87 Difference]: Start difference. First operand 111 states and 166 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-01-09 08:28:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:51,037 INFO L93 Difference]: Finished difference Result 502 states and 723 transitions. [2025-01-09 08:28:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 08:28:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 137 [2025-01-09 08:28:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:51,040 INFO L225 Difference]: With dead ends: 502 [2025-01-09 08:28:51,040 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 08:28:51,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 08:28:51,042 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 492 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:51,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 698 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:28:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 08:28:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 334. [2025-01-09 08:28:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 217 states have internal predecessors, (265), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 08:28:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 479 transitions. [2025-01-09 08:28:51,075 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 479 transitions. Word has length 137 [2025-01-09 08:28:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:51,075 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 479 transitions. [2025-01-09 08:28:51,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-01-09 08:28:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 479 transitions. [2025-01-09 08:28:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 08:28:51,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:51,077 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:51,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:28:51,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:51,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:51,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash -465974679, now seen corresponding path program 1 times [2025-01-09 08:28:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838000124] [2025-01-09 08:28:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:51,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:28:51,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:28:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:28:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160074036] [2025-01-09 08:28:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:51,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:28:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:28:51,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:28:51,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:28:51,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:28:51,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:28:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 08:28:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 08:28:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:28:51,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:28:51,679 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:28:51,680 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:28:51,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:28:51,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:28:51,884 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 08:28:51,967 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:28:51,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:28:51 BoogieIcfgContainer [2025-01-09 08:28:51,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:28:51,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:28:51,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:28:51,972 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:28:51,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:46" (3/4) ... [2025-01-09 08:28:51,974 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:28:51,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:28:51,975 INFO L158 Benchmark]: Toolchain (without parser) took 6495.21ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 132.1MB in the beginning and 80.2MB in the end (delta: 51.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2025-01-09 08:28:51,975 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:28:51,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.28ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 117.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:28:51,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.52ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:28:51,976 INFO L158 Benchmark]: Boogie Preprocessor took 48.11ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 109.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:28:51,976 INFO L158 Benchmark]: RCFGBuilder took 314.06ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 87.2MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:28:51,976 INFO L158 Benchmark]: TraceAbstraction took 5861.65ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.4MB in the beginning and 82.4MB in the end (delta: 3.9MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2025-01-09 08:28:51,976 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 209.7MB. Free memory was 82.4MB in the beginning and 80.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:28:51,977 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.21ms. Allocated memory is still 218.1MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.28ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 117.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.52ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 114.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.11ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 109.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 314.06ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 87.2MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5861.65ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.4MB in the beginning and 82.4MB in the end (delta: 3.9MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 209.7MB. Free memory was 82.4MB in the beginning and 80.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 130. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L134] isInitial = 1 [L135] FCALL initially() [L137] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L105] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L138] RET updateVariables() [L139] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L55] COND TRUE \read(last_1_var_1_12) [L56] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L58] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=16] [L65] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L66] COND FALSE !((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483375, var_1_20=0, var_1_21=-256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 1268 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 377 mSDtfsCounter, 866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 123 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1091 NumberOfCodeBlocks, 1091 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 945 ConstructedInterpolants, 0 QuantifiedInterpolants, 3697 SizeOfPredicates, 3 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5678/5880 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-01-09 08:28:51,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:28:54,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:28:54,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:28:54,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:28:54,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:28:54,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:28:54,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:28:54,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:28:54,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:28:54,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:28:54,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:28:54,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:28:54,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:28:54,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:28:54,240 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:28:54,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:28:54,241 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:28:54,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:54,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:28:54,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:54,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:28:54,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:28:54,244 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-jdk21/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 -> 17c28f5c9c0d305f6f66e69f023e955b6e145200d4f06514fc000568801e139d [2025-01-09 08:28:54,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:28:54,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:28:54,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:28:54,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:28:54,509 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:28:54,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:55,726 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109a506ff/a1b0795f9fb84d0eb30b8c305d6da19b/FLAGe85be20df [2025-01-09 08:28:55,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:28:55,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:55,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109a506ff/a1b0795f9fb84d0eb30b8c305d6da19b/FLAGe85be20df [2025-01-09 08:28:56,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/109a506ff/a1b0795f9fb84d0eb30b8c305d6da19b [2025-01-09 08:28:56,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:28:56,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:28:56,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:56,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:28:56,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:28:56,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56, skipping insertion in model container [2025-01-09 08:28:56,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:28:56,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i[919,932] [2025-01-09 08:28:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:56,456 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:28:56,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-49.i[919,932] [2025-01-09 08:28:56,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:28:56,507 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:28:56,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56 WrapperNode [2025-01-09 08:28:56,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:28:56,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:56,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:28:56,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:28:56,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,552 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-01-09 08:28:56,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:28:56,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:28:56,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:28:56,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:28:56,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,580 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-01-09 08:28:56,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:28:56,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:28:56,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:28:56,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:28:56,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (1/1) ... [2025-01-09 08:28:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:28:56,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:28:56,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:28:56,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:28:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:28:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:28:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:28:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:28:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:28:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:28:56,711 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:28:56,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:28:56,959 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:28:56,959 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:28:56,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:28:56,966 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:28:56,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:56 BoogieIcfgContainer [2025-01-09 08:28:56,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:28:56,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:28:56,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:28:56,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:28:56,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:28:56" (1/3) ... [2025-01-09 08:28:56,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a7229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:56, skipping insertion in model container [2025-01-09 08:28:56,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:56" (2/3) ... [2025-01-09 08:28:56,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5a7229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:56, skipping insertion in model container [2025-01-09 08:28:56,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:56" (3/3) ... [2025-01-09 08:28:56,974 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-49.i [2025-01-09 08:28:56,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:28:56,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-49.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:28:57,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:28:57,026 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;@519b92c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:28:57,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:28:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:28:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 08:28:57,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:57,037 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:57,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash -355611016, now seen corresponding path program 1 times [2025-01-09 08:28:57,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:28:57,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320489148] [2025-01-09 08:28:57,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:57,049 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-01-09 08:28:57,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:28:57,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 08:28:57,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:28:57,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 08:28:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 08:28:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:57,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:28:57,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 08:28:57,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:28:57,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:28:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320489148] [2025-01-09 08:28:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320489148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:28:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733073804] [2025-01-09 08:28:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:57,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:28:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:28:57,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:28:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:28:57,417 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:28:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:57,443 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2025-01-09 08:28:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:28:57,446 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-01-09 08:28:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:57,451 INFO L225 Difference]: With dead ends: 117 [2025-01-09 08:28:57,451 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 08:28:57,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-01-09 08:28:57,455 INFO L435 NwaCegarLoop]: 86 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, 86 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-01-09 08:28:57,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:28:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 08:28:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 08:28:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 08:28:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-01-09 08:28:57,493 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 132 [2025-01-09 08:28:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-01-09 08:28:57,493 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 08:28:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-01-09 08:28:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 08:28:57,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:57,496 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:57,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:28:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 08:28:57,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:57,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash 85387010, now seen corresponding path program 1 times [2025-01-09 08:28:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:28:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953759912] [2025-01-09 08:28:57,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:57,703 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-01-09 08:28:57,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:28:57,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 08:28:57,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:28:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 08:28:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 08:28:57,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:57,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:57,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 08:28:57,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:28:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 08:28:58,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:28:58,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:28:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953759912] [2025-01-09 08:28:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953759912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:28:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582996552] [2025-01-09 08:28:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:58,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:28:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:28:58,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:28:58,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:28:58,210 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:58,474 INFO L93 Difference]: Finished difference Result 175 states and 263 transitions. [2025-01-09 08:28:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:28:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-01-09 08:28:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:58,485 INFO L225 Difference]: With dead ends: 175 [2025-01-09 08:28:58,485 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 08:28:58,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:28:58,486 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 63 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:58,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 242 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:28:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 08:28:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2025-01-09 08:28:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:28:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2025-01-09 08:28:58,502 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 132 [2025-01-09 08:28:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:58,502 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2025-01-09 08:28:58,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 08:28:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2025-01-09 08:28:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 08:28:58,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:58,504 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:28:58,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:28:58,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 08:28:58,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:58,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1123705686, now seen corresponding path program 1 times [2025-01-09 08:28:58,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:28:58,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423710807] [2025-01-09 08:28:58,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:58,713 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-01-09 08:28:58,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:28:58,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 08:28:58,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 08:28:58,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 08:28:58,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 08:28:58,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:58,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 08:28:58,947 INFO L279 TraceCheckSpWp]: Computing forward predicates...