./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.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_amount25_file-58.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 8bff6c0f8e15029ad0c69d66a327b450bc06692e04fabba5a0800800584ec965 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:37:22,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:37:22,736 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:37:22,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:37:22,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:37:22,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:37:22,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:37:22,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:37:22,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:37:22,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:37:22,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:37:22,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:37:22,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:37:22,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:37:22,774 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:37:22,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:37:22,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:22,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:37:22,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:22,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:37:22,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:37:22,776 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 -> 8bff6c0f8e15029ad0c69d66a327b450bc06692e04fabba5a0800800584ec965 [2025-01-09 14:37:22,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:37:22,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:37:22,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:37:22,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:37:22,987 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:37:22,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:24,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa908a1d8/980a28e2a96f4d2cb4d359bbb960326f/FLAGd6cabb016 [2025-01-09 14:37:24,343 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:37:24,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:24,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa908a1d8/980a28e2a96f4d2cb4d359bbb960326f/FLAGd6cabb016 [2025-01-09 14:37:24,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa908a1d8/980a28e2a96f4d2cb4d359bbb960326f [2025-01-09 14:37:24,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:37:24,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:37:24,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:37:24,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:37:24,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:37:24,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56581c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24, skipping insertion in model container [2025-01-09 14:37:24,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:37:24,805 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_amount25_file-58.i[915,928] [2025-01-09 14:37:24,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:37:24,853 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:37:24,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_amount25_file-58.i[915,928] [2025-01-09 14:37:24,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:37:24,895 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:37:24,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24 WrapperNode [2025-01-09 14:37:24,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:37:24,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:37:24,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:37:24,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:37:24,901 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:37:24" (1/1) ... [2025-01-09 14:37:24,908 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:37:24" (1/1) ... [2025-01-09 14:37:24,934 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-01-09 14:37:24,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:37:24,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:37:24,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:37:24,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:37:24,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,960 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:37:24,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:37:24,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:37:24,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:37:24,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:37:24,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (1/1) ... [2025-01-09 14:37:24,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:24,997 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:37:25,002 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:37:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:37:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:37:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:37:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:37:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:37:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:37:25,073 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:37:25,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:37:25,224 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 14:37:25,224 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:37:25,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:37:25,230 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:37:25,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:25 BoogieIcfgContainer [2025-01-09 14:37:25,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:37:25,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:37:25,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:37:25,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:37:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:37:24" (1/3) ... [2025-01-09 14:37:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06fb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:25, skipping insertion in model container [2025-01-09 14:37:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:24" (2/3) ... [2025-01-09 14:37:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b06fb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:25, skipping insertion in model container [2025-01-09 14:37:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:25" (3/3) ... [2025-01-09 14:37:25,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:25,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:37:25,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:37:25,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:37:25,286 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;@2d5d1940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:37:25,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:37:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:37:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:25,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:25,294 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:25,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1395768115, now seen corresponding path program 1 times [2025-01-09 14:37:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:37:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957888332] [2025-01-09 14:37:25,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:37:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:25,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:25,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:25,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:37:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:37:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957888332] [2025-01-09 14:37:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957888332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:37:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623502056] [2025-01-09 14:37:25,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:25,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:25,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:25,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:37:25,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:37:25,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:25,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:25,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:25,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:25,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:37:25,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:37:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 14:37:25,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:37:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623502056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:37:25,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:37:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:37:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009114014] [2025-01-09 14:37:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:37:25,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:37:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:37:25,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:37:25,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:37:25,610 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:37:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:37:25,627 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-01-09 14:37:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:37:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-01-09 14:37:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:37:25,634 INFO L225 Difference]: With dead ends: 82 [2025-01-09 14:37:25,635 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 14:37:25,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:37:25,639 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:37:25,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:37:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 14:37:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 14:37:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:37:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 14:37:25,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-01-09 14:37:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:37:25,666 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 14:37:25,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:37:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 14:37:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:25,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:25,668 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:25,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:37:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:37:25,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1163316343, now seen corresponding path program 1 times [2025-01-09 14:37:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:37:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258030910] [2025-01-09 14:37:25,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:37:25,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:25,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:25,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:37:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265543598] [2025-01-09 14:37:25,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:25,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:25,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:37:25,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:37:26,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:26,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:26,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:26,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:26,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:37:26,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:37:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 14:37:26,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:37:27,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:37:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258030910] [2025-01-09 14:37:27,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:37:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265543598] [2025-01-09 14:37:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265543598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:37:27,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:37:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-01-09 14:37:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773507351] [2025-01-09 14:37:27,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:37:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:37:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:37:27,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:37:27,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:37:27,281 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 14:37:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:37:29,561 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2025-01-09 14:37:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:37:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-01-09 14:37:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:37:29,563 INFO L225 Difference]: With dead ends: 143 [2025-01-09 14:37:29,565 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 14:37:29,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:37:29,567 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 108 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:37:29,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 263 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:37:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 14:37:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2025-01-09 14:37:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 14:37:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2025-01-09 14:37:29,579 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 81 [2025-01-09 14:37:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:37:29,580 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2025-01-09 14:37:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 14:37:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2025-01-09 14:37:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:29,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:29,581 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:37:29,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:29,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:29,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1161469301, now seen corresponding path program 1 times [2025-01-09 14:37:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:37:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401934326] [2025-01-09 14:37:29,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:37:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:29,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:37:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40176561] [2025-01-09 14:37:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:29,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:37:29,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:37:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:29,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:29,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:29,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:37:29,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:37:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 14:37:30,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:37:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:37:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401934326] [2025-01-09 14:37:30,390 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:37:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40176561] [2025-01-09 14:37:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40176561] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:37:30,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:37:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 14:37:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466167365] [2025-01-09 14:37:30,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:37:30,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:37:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:37:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:37:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:37:30,392 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 14:37:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:37:30,919 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2025-01-09 14:37:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:37:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-01-09 14:37:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:37:30,922 INFO L225 Difference]: With dead ends: 222 [2025-01-09 14:37:30,922 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 14:37:30,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:37:30,923 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:37:30,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 292 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:37:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 14:37:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2025-01-09 14:37:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 83 states have internal predecessors, (94), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 14:37:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2025-01-09 14:37:30,937 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 81 [2025-01-09 14:37:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:37:30,937 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2025-01-09 14:37:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 14:37:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2025-01-09 14:37:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:30,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:30,939 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:30,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:37:31,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:31,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:31,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1843374713, now seen corresponding path program 1 times [2025-01-09 14:37:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:37:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4143521] [2025-01-09 14:37:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:37:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:31,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:31,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:31,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:37:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024369903] [2025-01-09 14:37:31,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:31,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:37:31,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:37:31,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:31,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:37:31,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:37:31,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:31,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:31,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:37:31,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:37:31,282 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:37:31,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:37:31,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:37:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:37:31,487 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 14:37:31,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:37:31,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:37:31 BoogieIcfgContainer [2025-01-09 14:37:31,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:37:31,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:37:31,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:37:31,549 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:37:31,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:25" (3/4) ... [2025-01-09 14:37:31,552 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:37:31,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:37:31,554 INFO L158 Benchmark]: Toolchain (without parser) took 6863.75ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 111.0MB in the beginning and 279.3MB in the end (delta: -168.3MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2025-01-09 14:37:31,555 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:37:31,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.04ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 97.8MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:37:31,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.06ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:37:31,556 INFO L158 Benchmark]: Boogie Preprocessor took 33.40ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 92.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:37:31,556 INFO L158 Benchmark]: RCFGBuilder took 260.92ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:37:31,556 INFO L158 Benchmark]: TraceAbstraction took 6316.26ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 75.2MB in the beginning and 279.3MB in the end (delta: -204.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-01-09 14:37:31,556 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 310.4MB. Free memory was 279.3MB in the beginning and 279.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:37:31,557 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.04ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 97.8MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.06ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.40ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 92.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.92ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6316.26ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 75.2MB in the beginning and 279.3MB in the end (delta: -204.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 310.4MB. Free memory was 279.3MB in the beginning and 279.3MB in the end (delta: 41.6kB). 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 80, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] signed long int var_1_2 = 8; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 100; [L26] float var_1_5 = 99999999999.5; [L27] unsigned char var_1_6 = 4; [L28] float var_1_7 = 63.75; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char last_1_var_1_1 = 64; [L32] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L94] isInitial = 1 [L95] FCALL initially() [L97] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L73] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L75] var_1_6 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_6 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] RET assume_abort_if_not(var_1_6 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_7=255/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_7=255/4, var_1_9=0] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L80] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L36] signed long int stepLocal_3 = last_1_var_1_1; [L37] signed long int stepLocal_2 = var_1_3 / var_1_6; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=64, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L38] COND TRUE var_1_3 < stepLocal_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L39] COND FALSE !(var_1_4 < stepLocal_2) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L49] signed long int stepLocal_1 = var_1_2; [L50] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=-256, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L51] COND TRUE stepLocal_1 <= -256 [L52] var_1_1 = ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L60] unsigned char stepLocal_4 = (var_1_1 + 64u) != var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_4=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L61] COND FALSE !((var_1_5 >= var_1_7) || stepLocal_4) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((var_1_2 <= -256) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))))) : ((var_1_4 <= var_1_2) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((var_1_3 < last_1_var_1_1) ? ((var_1_4 < (var_1_3 / var_1_6)) ? (var_1_5 == ((float) (var_1_7 - 16.55f))) : 1) : (last_1_var_1_9 ? (var_1_5 == ((float) var_1_7)) : (var_1_5 == ((float) var_1_7))))) && (((var_1_5 >= var_1_7) || ((var_1_1 + 64u) != var_1_4)) ? (var_1_9 == ((unsigned char) var_1_10)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=256, var_1_4=64, var_1_5=199999999999/2, var_1_6=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 613 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 707 IncrementalHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 141 mSDtfsCounter, 707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=3, InterpolantAutomatonStates: 42, 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, 35 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 320 ConstructedInterpolants, 7 QuantifiedInterpolants, 1313 SizeOfPredicates, 9 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 980/1056 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:37:31,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.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 8bff6c0f8e15029ad0c69d66a327b450bc06692e04fabba5a0800800584ec965 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:37:33,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:37:33,533 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:37:33,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:37:33,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:37:33,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:37:33,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:37:33,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:37:33,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:37:33,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:37:33,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:37:33,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:37:33,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:37:33,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:37:33,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:37:33,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:37:33,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:33,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:37:33,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:33,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:37:33,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:37:33,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:37:33,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:37:33,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:37:33,572 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 -> 8bff6c0f8e15029ad0c69d66a327b450bc06692e04fabba5a0800800584ec965 [2025-01-09 14:37:33,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:37:33,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:37:33,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:37:33,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:37:33,837 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:37:33,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:35,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad845c1c/eb3f94a9146b4199b3656e952ac8a093/FLAG2d5e1c23e [2025-01-09 14:37:35,226 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:37:35,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:35,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad845c1c/eb3f94a9146b4199b3656e952ac8a093/FLAG2d5e1c23e [2025-01-09 14:37:35,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad845c1c/eb3f94a9146b4199b3656e952ac8a093 [2025-01-09 14:37:35,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:37:35,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:37:35,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:37:35,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:37:35,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:37:35,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35, skipping insertion in model container [2025-01-09 14:37:35,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:37:35,377 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_amount25_file-58.i[915,928] [2025-01-09 14:37:35,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:37:35,426 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:37:35,434 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_amount25_file-58.i[915,928] [2025-01-09 14:37:35,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:37:35,469 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:37:35,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35 WrapperNode [2025-01-09 14:37:35,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:37:35,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:37:35,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:37:35,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:37:35,477 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:37:35" (1/1) ... [2025-01-09 14:37:35,488 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:37:35" (1/1) ... [2025-01-09 14:37:35,505 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-01-09 14:37:35,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:37:35,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:37:35,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:37:35,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:37:35,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,527 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:37:35,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:37:35,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:37:35,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:37:35,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:37:35,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (1/1) ... [2025-01-09 14:37:35,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:37:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:37:35,572 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:37:35,584 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:37:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:37:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:37:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:37:35,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:37:35,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:37:35,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:37:35,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:37:35,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:37:35,850 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 14:37:35,850 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:37:35,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:37:35,856 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:37:35,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:35 BoogieIcfgContainer [2025-01-09 14:37:35,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:37:35,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:37:35,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:37:35,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:37:35,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:37:35" (1/3) ... [2025-01-09 14:37:35,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa9dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:35, skipping insertion in model container [2025-01-09 14:37:35,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:37:35" (2/3) ... [2025-01-09 14:37:35,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa9dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:37:35, skipping insertion in model container [2025-01-09 14:37:35,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:37:35" (3/3) ... [2025-01-09 14:37:35,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-58.i [2025-01-09 14:37:35,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:37:35,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:37:35,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:37:35,922 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;@78c39618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:37:35,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:37:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:37:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:35,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:35,932 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1395768115, now seen corresponding path program 1 times [2025-01-09 14:37:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:37:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454527135] [2025-01-09 14:37:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:35,942 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:37:35,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:37:35,944 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:37:35,946 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:37:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:36,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:36,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:36,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:36,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:37:36,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:37:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 14:37:36,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:37:36,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:37:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454527135] [2025-01-09 14:37:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454527135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:37:36,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:37:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:37:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428352612] [2025-01-09 14:37:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:37:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:37:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:37:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:37:36,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:37:36,130 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:37:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:37:36,143 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-01-09 14:37:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:37:36,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-01-09 14:37:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:37:36,149 INFO L225 Difference]: With dead ends: 82 [2025-01-09 14:37:36,149 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 14:37:36,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:37:36,152 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:37:36,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:37:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 14:37:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 14:37:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:37:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 14:37:36,176 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-01-09 14:37:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:37:36,176 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 14:37:36,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 14:37:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 14:37:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:37:36,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:37:36,178 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:36,186 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:37:36,379 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:37:36,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:37:36,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:37:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1163316343, now seen corresponding path program 1 times [2025-01-09 14:37:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:37:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150513327] [2025-01-09 14:37:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:37:36,380 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:37:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:37:36,384 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:37:36,385 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:37:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:37:36,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:37:36,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:37:36,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:37:36,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:37:36,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:37:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 177 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 14:37:45,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:38:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 14:38:00,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:38:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150513327] [2025-01-09 14:38:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150513327] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:38:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:38:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2025-01-09 14:38:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206992852] [2025-01-09 14:38:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:38:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:38:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:38:00,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:38:00,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:38:00,480 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:38:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:38:06,150 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2025-01-09 14:38:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:38:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-01-09 14:38:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:38:06,153 INFO L225 Difference]: With dead ends: 61 [2025-01-09 14:38:06,153 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 14:38:06,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:38:06,154 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:38:06,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 282 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:38:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 14:38:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2025-01-09 14:38:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 14:38:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-09 14:38:06,160 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 81 [2025-01-09 14:38:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:38:06,165 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-09 14:38:06,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 14:38:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-01-09 14:38:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 14:38:06,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:38:06,167 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,180 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:38:06,368 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:38:06,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:38:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:38:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1161469301, now seen corresponding path program 1 times [2025-01-09 14:38:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:38:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851671419] [2025-01-09 14:38:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:38:06,371 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:38:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:38:06,375 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:38:06,377 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:38:06,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:38:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:38:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:38:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:38:06,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 14:38:06,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:38:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 14:38:07,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:38:23,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:38:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851671419] [2025-01-09 14:38:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851671419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:38:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1303411880] [2025-01-09 14:38:23,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:38:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:38:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:38:23,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:38:23,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 14:38:23,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 14:38:23,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 14:38:23,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:38:23,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:38:23,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:38:23,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:38:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 14:38:46,522 INFO L312 TraceCheckSpWp]: Computing backward predicates...