./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.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_operatoramount_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:18:38,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:18:38,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:18:38,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:18:38,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:18:38,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:18:38,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:18:38,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:18:38,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:18:38,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:18:38,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:18:38,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:18:38,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:18:38,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:38,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:38,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:18:38,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:18:38,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:18:38,130 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2025-01-09 14:18:38,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:18:38,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:18:38,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:18:38,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:18:38,311 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:18:38,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:39,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0eae208e/325940a70c82496fa27e41bc28303181/FLAG1ee601fb8 [2025-01-09 14:18:39,638 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:18:39,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:39,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0eae208e/325940a70c82496fa27e41bc28303181/FLAG1ee601fb8 [2025-01-09 14:18:39,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0eae208e/325940a70c82496fa27e41bc28303181 [2025-01-09 14:18:39,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:18:39,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:18:39,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:39,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:18:39,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:18:39,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abe9f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39, skipping insertion in model container [2025-01-09 14:18:39,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:18:39,818 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_operatoramount_amount10_file-80.i[915,928] [2025-01-09 14:18:39,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:39,853 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:18:39,861 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_operatoramount_amount10_file-80.i[915,928] [2025-01-09 14:18:39,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:39,886 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:18:39,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39 WrapperNode [2025-01-09 14:18:39,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:39,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:39,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:18:39,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:18:39,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,912 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-01-09 14:18:39,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:39,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:18:39,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:18:39,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:18:39,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,933 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 14:18:39,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:18:39,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:18:39,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:18:39,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:18:39,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (1/1) ... [2025-01-09 14:18:39,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:18:39,977 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 14:18:39,984 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 14:18:39,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:18:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:18:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:18:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:18:39,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:18:39,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:18:40,044 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:18:40,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:18:40,149 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:18:40,149 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:18:40,154 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:18:40,155 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:18:40,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:40 BoogieIcfgContainer [2025-01-09 14:18:40,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:18:40,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:18:40,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:18:40,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:18:40,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:18:39" (1/3) ... [2025-01-09 14:18:40,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205bfd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:40, skipping insertion in model container [2025-01-09 14:18:40,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:39" (2/3) ... [2025-01-09 14:18:40,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205bfd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:40, skipping insertion in model container [2025-01-09 14:18:40,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:40" (3/3) ... [2025-01-09 14:18:40,161 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:40,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:18:40,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-80.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:18:40,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:18:40,208 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;@219814, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:18:40,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:18:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:18:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:18:40,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:40,215 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:40,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 290812766, now seen corresponding path program 1 times [2025-01-09 14:18:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:18:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702251267] [2025-01-09 14:18:40,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:40,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:18:40,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:18:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:18:40,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:40,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 14:18:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:18:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702251267] [2025-01-09 14:18:40,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702251267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:40,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:18:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459339476] [2025-01-09 14:18:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:40,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:18:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:18:40,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:18:40,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:18:40,941 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:41,102 INFO L93 Difference]: Finished difference Result 108 states and 180 transitions. [2025-01-09 14:18:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:18:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-01-09 14:18:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:41,113 INFO L225 Difference]: With dead ends: 108 [2025-01-09 14:18:41,113 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 14:18:41,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:18:41,120 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 63 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:41,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 269 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:18:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 14:18:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 54. [2025-01-09 14:18:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:18:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-01-09 14:18:41,155 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 66 [2025-01-09 14:18:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:41,155 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-01-09 14:18:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2025-01-09 14:18:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 14:18:41,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:41,159 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:18:41,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:41,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 189700819, now seen corresponding path program 1 times [2025-01-09 14:18:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:18:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603586706] [2025-01-09 14:18:41,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:18:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 14:18:41,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 14:18:41,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 14:18:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:18:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603586706] [2025-01-09 14:18:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603586706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:41,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:18:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991966852] [2025-01-09 14:18:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:18:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:18:41,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:18:41,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:18:41,727 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:42,043 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2025-01-09 14:18:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:18:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2025-01-09 14:18:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:42,046 INFO L225 Difference]: With dead ends: 94 [2025-01-09 14:18:42,046 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 14:18:42,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:18:42,048 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:42,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 247 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:18:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 14:18:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2025-01-09 14:18:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-01-09 14:18:42,068 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 67 [2025-01-09 14:18:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:42,069 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-01-09 14:18:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-01-09 14:18:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 14:18:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:42,070 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:18:42,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 191547861, now seen corresponding path program 1 times [2025-01-09 14:18:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:18:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263010179] [2025-01-09 14:18:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:18:42,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 14:18:42,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 14:18:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:18:42,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:18:42,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 14:18:42,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 14:18:42,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:42,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:18:42,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:18:42,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:18:42,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:18:42,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:18:42,142 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:18:42,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:18:42,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:18:42 BoogieIcfgContainer [2025-01-09 14:18:42,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:18:42,175 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:18:42,175 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:18:42,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:18:42,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:40" (3/4) ... [2025-01-09 14:18:42,177 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:18:42,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:18:42,179 INFO L158 Benchmark]: Toolchain (without parser) took 2476.57ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 82.5MB in the end (delta: 39.3MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-01-09 14:18:42,179 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:42,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.44ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 110.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:42,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.20ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.4MB in the end (delta: 949.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:42,179 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:42,180 INFO L158 Benchmark]: RCFGBuilder took 207.53ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 95.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:42,180 INFO L158 Benchmark]: TraceAbstraction took 2018.33ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 82.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2025-01-09 14:18:42,180 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 82.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:42,181 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.15ms. Allocated memory is still 226.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.44ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 110.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.20ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.4MB in the end (delta: 949.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 207.53ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 95.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2018.33ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 82.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 82.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 42, overapproximation of someBinaryFLOATComparisonOperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] float var_1_4 = 200.75; [L24] float var_1_5 = 5.7; [L25] signed short int var_1_6 = 200; [L26] signed short int var_1_7 = 256; [L27] signed short int var_1_8 = -16; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; VAL [isInitial=0, var_1_10=0, var_1_1=4, var_1_4=803/4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L65] isInitial = 1 [L66] FCALL initially() [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_4 = __VERIFIER_nondet_float() [L42] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L42] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_5=57/10, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L43] var_1_5 = __VERIFIER_nondet_float() [L44] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L44] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=200, var_1_7=256, var_1_8=-16, var_1_9=1] [L45] var_1_6 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_6 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L46] RET assume_abort_if_not(var_1_6 >= -8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L47] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=256, var_1_8=-16, var_1_9=1] [L48] var_1_7 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L49] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L50] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16, var_1_9=1] [L51] var_1_8 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L52] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L53] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L54] var_1_10 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L55] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L56] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=1] [L69] RET updateVariables() [L70] CALL step() [L33] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L34] COND TRUE ! (var_1_9 && var_1_9) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L35] COND FALSE !(var_1_4 <= var_1_5) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return ((! (var_1_9 && var_1_9)) ? ((var_1_4 <= var_1_5) ? (var_1_1 == ((signed short int) ((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7) + var_1_8))) : 1) : 1) && (var_1_9 == ((unsigned char) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-256, var_1_1=4, var_1_6=1, var_1_7=-8191, var_1_8=-16383, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 516 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 133 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 360/360 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 14:18:42,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_operatoramount_amount10_file-80.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 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:18:44,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:18:44,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:18:44,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:18:44,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:18:44,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:18:44,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:18:44,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:18:44,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:18:44,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:18:44,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:18:44,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:18:44,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:18:44,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:18:44,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:44,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:18:44,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:44,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:18:44,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:18:44,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:18:44,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:18:44,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:18:44,343 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 -> 85b1d2ec59250ca50e4af3cfea516d1a969ce9b16ea60a43749666e7f67d56c7 [2025-01-09 14:18:44,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:18:44,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:18:44,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:18:44,557 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:18:44,557 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:18:44,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:45,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0f6f50b/e9132d880d7140d29fa0725464bbe3b7/FLAGd9d0c4cc7 [2025-01-09 14:18:45,932 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:18:45,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:45,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0f6f50b/e9132d880d7140d29fa0725464bbe3b7/FLAGd9d0c4cc7 [2025-01-09 14:18:45,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0f6f50b/e9132d880d7140d29fa0725464bbe3b7 [2025-01-09 14:18:45,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:18:45,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:18:45,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:45,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:18:45,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:18:45,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:45" (1/1) ... [2025-01-09 14:18:45,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b4c2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:45, skipping insertion in model container [2025-01-09 14:18:45,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:18:45" (1/1) ... [2025-01-09 14:18:45,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:18:46,080 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_operatoramount_amount10_file-80.i[915,928] [2025-01-09 14:18:46,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:46,122 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:18:46,131 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_operatoramount_amount10_file-80.i[915,928] [2025-01-09 14:18:46,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:18:46,152 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:18:46,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46 WrapperNode [2025-01-09 14:18:46,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:18:46,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:46,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:18:46,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:18:46,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,196 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-01-09 14:18:46,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:18:46,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:18:46,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:18:46,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:18:46,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,225 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 14:18:46,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:18:46,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:18:46,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:18:46,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:18:46,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (1/1) ... [2025-01-09 14:18:46,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:18:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:18:46,275 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 14:18:46,277 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 14:18:46,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:18:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:18:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:18:46,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:18:46,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:18:46,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:18:46,353 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:18:46,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:18:46,483 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:18:46,483 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:18:46,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:18:46,491 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:18:46,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:46 BoogieIcfgContainer [2025-01-09 14:18:46,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:18:46,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:18:46,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:18:46,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:18:46,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:18:45" (1/3) ... [2025-01-09 14:18:46,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a3831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:46, skipping insertion in model container [2025-01-09 14:18:46,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:18:46" (2/3) ... [2025-01-09 14:18:46,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a3831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:18:46, skipping insertion in model container [2025-01-09 14:18:46,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:46" (3/3) ... [2025-01-09 14:18:46,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-80.i [2025-01-09 14:18:46,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:18:46,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-80.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:18:46,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:18:46,550 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;@4b471d4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:18:46,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:18:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:18:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 14:18:46,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:46,559 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:46,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:46,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 290812766, now seen corresponding path program 1 times [2025-01-09 14:18:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272851997] [2025-01-09 14:18:46,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:46,571 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 14:18:46,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:46,573 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 14:18:46,575 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 14:18:46,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 14:18:46,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 14:18:46,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:46,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:46,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:18:46,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 14:18:46,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:18:46,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:18:46,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272851997] [2025-01-09 14:18:46,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272851997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:46,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:18:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978378380] [2025-01-09 14:18:46,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:18:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:18:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:18:46,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:18:46,776 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:47,043 INFO L93 Difference]: Finished difference Result 100 states and 160 transitions. [2025-01-09 14:18:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:18:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-01-09 14:18:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:47,049 INFO L225 Difference]: With dead ends: 100 [2025-01-09 14:18:47,049 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 14:18:47,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:18:47,053 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:47,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:18:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 14:18:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2025-01-09 14:18:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:18:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-01-09 14:18:47,079 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 66 [2025-01-09 14:18:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:47,079 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-01-09 14:18:47,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-01-09 14:18:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 14:18:47,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:47,081 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:47,087 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 14:18:47,282 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 14:18:47,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 189700819, now seen corresponding path program 1 times [2025-01-09 14:18:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975696102] [2025-01-09 14:18:47,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:47,283 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 14:18:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:47,288 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 14:18:47,291 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 14:18:47,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 14:18:47,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 14:18:47,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:47,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:47,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:18:47,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 14:18:48,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:18:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 14:18:48,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:18:48,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975696102] [2025-01-09 14:18:48,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975696102] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:18:48,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:18:48,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2025-01-09 14:18:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193363771] [2025-01-09 14:18:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:48,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:18:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:18:48,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:18:48,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:18:48,934 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:49,095 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2025-01-09 14:18:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:18:49,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2025-01-09 14:18:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:49,097 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:18:49,097 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 14:18:49,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:18:49,098 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:49,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 234 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:18:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 14:18:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2025-01-09 14:18:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:18:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-01-09 14:18:49,106 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 67 [2025-01-09 14:18:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:49,106 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-01-09 14:18:49,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-01-09 14:18:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 14:18:49,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:18:49,107 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:49,112 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 14:18:49,308 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 14:18:49,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:18:49,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:18:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 191547861, now seen corresponding path program 1 times [2025-01-09 14:18:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:18:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634304753] [2025-01-09 14:18:49,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:18:49,309 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 14:18:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:18:49,311 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 14:18:49,313 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 14:18:49,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 14:18:49,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 14:18:49,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:18:49,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:18:49,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:18:49,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:18:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 14:18:49,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:18:49,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:18:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634304753] [2025-01-09 14:18:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634304753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:18:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:18:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:18:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455596916] [2025-01-09 14:18:49,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:18:49,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:18:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:18:49,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:18:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:18:49,598 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:18:49,715 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-01-09 14:18:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:18:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2025-01-09 14:18:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:18:49,716 INFO L225 Difference]: With dead ends: 69 [2025-01-09 14:18:49,716 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:18:49,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:18:49,717 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:18:49,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:18:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:18:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:18:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 14:18:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:18:49,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2025-01-09 14:18:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:18:49,719 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:18:49,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 14:18:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:18:49,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:18:49,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:18:49,725 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 (4)] Ended with exit code 0 [2025-01-09 14:18:49,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 14:18:49,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:18:49,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:18:50,016 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:18:50,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:18:50 BoogieIcfgContainer [2025-01-09 14:18:50,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:18:50,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:18:50,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:18:50,024 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:18:50,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:18:46" (3/4) ... [2025-01-09 14:18:50,026 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:18:50,029 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:18:50,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:18:50,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:18:50,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:18:50,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:18:50,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:18:50,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:18:50,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:18:50,085 INFO L158 Benchmark]: Toolchain (without parser) took 4126.00ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 115.9MB in the beginning and 140.0MB in the end (delta: -24.1MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: CDTParser took 2.29ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.86ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 103.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.72ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: Boogie Preprocessor took 48.04ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: RCFGBuilder took 244.35ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 87.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: TraceAbstraction took 3529.98ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 87.2MB in the beginning and 145.9MB in the end (delta: -58.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-01-09 14:18:50,086 INFO L158 Benchmark]: Witness Printer took 61.09ms. Allocated memory is still 226.5MB. Free memory was 145.9MB in the beginning and 140.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:18:50,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.29ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.86ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 103.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.72ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.04ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 244.35ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 87.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3529.98ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 87.2MB in the beginning and 145.9MB in the end (delta: -58.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 61.09ms. Allocated memory is still 226.5MB. Free memory was 145.9MB in the beginning and 140.0MB in the end (delta: 5.9MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 412 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 181 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 808 SizeOfPredicates, 21 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 696/720 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (var_1_10 <= 0) RESULT: Ultimate proved your program to be correct! [2025-01-09 14:18:50,104 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 Writing output log to file Ultimate.log Result: TRUE