./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.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_variablewrapping_normal_file-41.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 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:09:50,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:09:50,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:09:50,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:09:50,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:09:50,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:09:50,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:09:50,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:09:50,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:09:50,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:09:50,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:09:50,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:09:50,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:09:50,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:09:50,179 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:09:50,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:09:50,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:09:50,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:09:50,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:09:50,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:50,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:09:50,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:09:50,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:09:50,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:09:50,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:50,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:09:50,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:09:50,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:09:50,184 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 -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2025-01-09 15:09:50,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:09:50,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:09:50,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:09:50,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:09:50,477 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:09:50,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:51,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4801e7/7774b0822d3c4e4ca91062ebd32cf586/FLAG3f21ea681 [2025-01-09 15:09:52,142 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:09:52,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:52,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4801e7/7774b0822d3c4e4ca91062ebd32cf586/FLAG3f21ea681 [2025-01-09 15:09:52,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfa4801e7/7774b0822d3c4e4ca91062ebd32cf586 [2025-01-09 15:09:52,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:09:52,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:09:52,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:09:52,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:09:52,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:09:52,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5803ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52, skipping insertion in model container [2025-01-09 15:09:52,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:09:52,547 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_variablewrapping_normal_file-41.i[913,926] [2025-01-09 15:09:52,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:09:52,614 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:09:52,625 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_variablewrapping_normal_file-41.i[913,926] [2025-01-09 15:09:52,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:09:52,670 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:09:52,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52 WrapperNode [2025-01-09 15:09:52,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:09:52,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:09:52,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:09:52,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:09:52,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,715 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-01-09 15:09:52,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:09:52,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:09:52,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:09:52,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:09:52,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,747 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 15:09:52,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:09:52,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:09:52,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:09:52,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:09:52,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (1/1) ... [2025-01-09 15:09:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:09:52,800 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 15:09:52,802 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 15:09:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:09:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:09:52,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:09:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:09:52,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:09:52,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:09:52,865 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:09:52,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:09:53,039 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:09:53,040 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:09:53,051 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:09:53,051 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:09:53,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:53 BoogieIcfgContainer [2025-01-09 15:09:53,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:09:53,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:09:53,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:09:53,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:09:53,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:09:52" (1/3) ... [2025-01-09 15:09:53,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c01b15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:53, skipping insertion in model container [2025-01-09 15:09:53,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:52" (2/3) ... [2025-01-09 15:09:53,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c01b15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:53, skipping insertion in model container [2025-01-09 15:09:53,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:53" (3/3) ... [2025-01-09 15:09:53,061 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:53,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:09:53,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-41.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:09:53,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:09:53,142 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;@516a3b45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:09:53,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:09:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:09:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:09:53,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:09:53,156 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:53,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:09:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:09:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1605650836, now seen corresponding path program 1 times [2025-01-09 15:09:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:09:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447282131] [2025-01-09 15:09:53,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:09:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:09:53,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:09:53,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:09:53,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:09:53,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:09:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:09:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:09:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447282131] [2025-01-09 15:09:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447282131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:09:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724761810] [2025-01-09 15:09:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:09:53,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:09:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:09:53,352 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 15:09:53,355 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 15:09:53,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:09:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:09:53,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:09:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:09:53,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:09:53,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:09:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 15:09:53,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:09:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724761810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:09:53,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:09:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:09:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339664187] [2025-01-09 15:09:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:09:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:09:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:09:53,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:09:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:09:53,518 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:09:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:09:53,535 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-01-09 15:09:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:09:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-01-09 15:09:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:09:53,542 INFO L225 Difference]: With dead ends: 88 [2025-01-09 15:09:53,542 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 15:09:53,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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 15:09:53,548 INFO L435 NwaCegarLoop]: 63 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, 63 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 15:09:53,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:09:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 15:09:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 15:09:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:09:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-01-09 15:09:53,581 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2025-01-09 15:09:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:09:53,582 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-01-09 15:09:53,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:09:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-01-09 15:09:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:09:53,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:09:53,587 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:53,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:09:53,791 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 15:09:53,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:09:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:09:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2062238704, now seen corresponding path program 1 times [2025-01-09 15:09:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:09:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710451319] [2025-01-09 15:09:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:09:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:09:53,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:09:53,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:09:53,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:09:53,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:09:53,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:09:53,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:09:53,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:09:53,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:09:53,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:09:54,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:09:54,036 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:09:54,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:09:54,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:09:54,042 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:09:54,111 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:09:54,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:09:54 BoogieIcfgContainer [2025-01-09 15:09:54,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:09:54,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:09:54,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:09:54,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:09:54,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:53" (3/4) ... [2025-01-09 15:09:54,117 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:09:54,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:09:54,119 INFO L158 Benchmark]: Toolchain (without parser) took 1722.14ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 46.4MB in the end (delta: 86.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 15:09:54,119 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:09:54,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.61ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:09:54,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 118.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:09:54,121 INFO L158 Benchmark]: Boogie Preprocessor took 57.60ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:09:54,122 INFO L158 Benchmark]: RCFGBuilder took 277.71ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 100.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:09:54,122 INFO L158 Benchmark]: TraceAbstraction took 1060.26ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 46.4MB in the end (delta: 53.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 15:09:54,123 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 167.8MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:09:54,125 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.61ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 118.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.60ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.71ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 100.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1060.26ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 46.4MB in the end (delta: 53.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 167.8MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_5 = 0; [L24] signed char var_1_6 = -8; [L25] signed char var_1_7 = 5; [L26] unsigned short int var_1_8 = 2; [L27] unsigned char var_1_11 = 0; [L28] double var_1_12 = 8.5; [L29] double var_1_13 = 999999999999.6; [L30] signed long int var_1_14 = 10; [L31] signed char var_1_15 = -1; [L32] unsigned char var_1_16 = 16; [L33] unsigned char var_1_17 = 64; [L34] signed char last_1_var_1_1 = -16; VAL [isInitial=0, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L99] isInitial = 1 [L100] FCALL initially() [L102] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L69] var_1_5 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L72] var_1_6 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L73] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L74] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L74] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L76] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L77] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L80] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L80] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L81] var_1_13 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L82] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L83] var_1_15 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L84] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L85] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L85] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L86] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L86] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L87] var_1_17 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L88] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L89] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L89] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L103] RET updateVariables() [L104] CALL step() [L38] COND TRUE var_1_5 && (last_1_var_1_1 <= last_1_var_1_1) [L39] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L41] var_1_12 = (var_1_13 - 8.3) [L42] unsigned char stepLocal_1 = var_1_13 >= var_1_12; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_1=1, var_1_11=0, var_1_14=10, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L43] COND TRUE var_1_5 && stepLocal_1 [L44] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=2] [L48] COND TRUE \read(var_1_5) [L49] var_1_8 = (var_1_16 + var_1_16) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] [L57] unsigned long int stepLocal_0 = (var_1_8 & 0u) * var_1_16; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_0=0, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] [L58] COND FALSE !(stepLocal_0 > var_1_8) [L65] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((((var_1_8 & 0u) * var_1_16) > var_1_8) ? (var_1_5 ? (var_1_1 == ((signed char) ((16 + var_1_6) + var_1_7))) : (var_1_1 == ((signed char) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_6))) && (var_1_5 ? (var_1_8 == ((unsigned short int) (var_1_16 + var_1_16))) : (((var_1_16 > var_1_14) || var_1_11) ? (var_1_8 == ((unsigned short int) var_1_16)) : (var_1_8 == ((unsigned short int) var_1_16))))) && (var_1_12 == ((double) (var_1_13 - 8.3)))) && ((var_1_5 && (var_1_13 >= var_1_12)) ? (var_1_14 == ((signed long int) var_1_16)) : (var_1_14 == ((signed long int) var_1_15)))) && ((var_1_5 && (last_1_var_1_1 <= last_1_var_1_1)) ? (var_1_16 == ((unsigned char) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_14=254, var_1_15=1, var_1_16=254, var_1_17=254, var_1_1=0, var_1_5=1, var_1_6=0, var_1_7=-63, var_1_8=508] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 63 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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 15:09:54,145 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_variablewrapping_normal_file-41.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 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:09:56,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:09:56,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:09:56,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:09:56,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:09:56,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:09:56,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:09:56,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:09:56,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:09:56,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:09:56,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:09:56,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:09:56,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:09:56,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:09:56,608 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:09:56,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:09:56,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:09:56,609 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:09:56,610 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:09:56,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:09:56,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:09:56,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:09:56,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:09:56,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:56,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:09:56,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:56,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:09:56,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:09:56,612 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 -> 64487a3fc6d0bb9c63963975f2a88f7204d26acaec706a494cf6a9d1aeef08e8 [2025-01-09 15:09:56,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:09:56,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:09:56,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:09:56,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:09:56,913 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:09:56,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:58,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544c745a0/a3d22b4371ed4689b3fa3fed629fd092/FLAG08915b47a [2025-01-09 15:09:58,428 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:09:58,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:58,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544c745a0/a3d22b4371ed4689b3fa3fed629fd092/FLAG08915b47a [2025-01-09 15:09:58,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544c745a0/a3d22b4371ed4689b3fa3fed629fd092 [2025-01-09 15:09:58,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:09:58,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:09:58,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:09:58,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:09:58,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:09:58,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59afcfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58, skipping insertion in model container [2025-01-09 15:09:58,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:09:58,631 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_variablewrapping_normal_file-41.i[913,926] [2025-01-09 15:09:58,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:09:58,694 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:09:58,703 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_variablewrapping_normal_file-41.i[913,926] [2025-01-09 15:09:58,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:09:58,740 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:09:58,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58 WrapperNode [2025-01-09 15:09:58,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:09:58,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:09:58,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:09:58,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:09:58,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,769 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-01-09 15:09:58,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:09:58,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:09:58,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:09:58,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:09:58,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,790 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 15:09:58,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:09:58,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:09:58,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:09:58,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:09:58,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (1/1) ... [2025-01-09 15:09:58,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:09:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:09:58,835 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 15:09:58,840 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 15:09:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:09:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:09:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:09:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:09:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:09:58,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:09:58,918 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:09:58,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:09:59,365 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 15:09:59,366 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:09:59,374 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:09:59,375 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:09:59,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:59 BoogieIcfgContainer [2025-01-09 15:09:59,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:09:59,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:09:59,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:09:59,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:09:59,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:09:58" (1/3) ... [2025-01-09 15:09:59,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5625f561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:59, skipping insertion in model container [2025-01-09 15:09:59,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:58" (2/3) ... [2025-01-09 15:09:59,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5625f561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:59, skipping insertion in model container [2025-01-09 15:09:59,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:59" (3/3) ... [2025-01-09 15:09:59,386 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-41.i [2025-01-09 15:09:59,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:09:59,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-41.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:09:59,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:09:59,461 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;@4cbc9686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:09:59,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:09:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:09:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:09:59,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:09:59,475 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:59,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:09:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:09:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1605650836, now seen corresponding path program 1 times [2025-01-09 15:09:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:09:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107282006] [2025-01-09 15:09:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:09:59,494 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 15:09:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:09:59,496 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 15:09:59,498 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 15:09:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:09:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:09:59,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:09:59,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:09:59,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:09:59,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:09:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-09 15:09:59,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:09:59,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:09:59,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107282006] [2025-01-09 15:09:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107282006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:09:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:09:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:09:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855250561] [2025-01-09 15:09:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:09:59,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:09:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:09:59,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:09:59,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:09:59,781 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:09:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:09:59,804 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-01-09 15:09:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:09:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-01-09 15:09:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:09:59,813 INFO L225 Difference]: With dead ends: 88 [2025-01-09 15:09:59,814 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 15:09:59,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 15:09:59,821 INFO L435 NwaCegarLoop]: 63 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, 63 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 15:09:59,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:09:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 15:09:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 15:09:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 15:09:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-01-09 15:09:59,860 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2025-01-09 15:09:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:09:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-01-09 15:09:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 15:09:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-01-09 15:09:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:09:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:09:59,866 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:09:59,875 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 15:10:00,067 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 15:10:00,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:10:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:10:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2062238704, now seen corresponding path program 1 times [2025-01-09 15:10:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:10:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578330772] [2025-01-09 15:10:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:10:00,069 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 15:10:00,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:10:00,071 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 15:10:00,072 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 15:10:00,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:10:00,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:10:00,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:10:00,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:10:00,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 15:10:00,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:10:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 15:10:57,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:10:57,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:10:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578330772] [2025-01-09 15:10:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578330772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:10:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:10:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:10:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626258658] [2025-01-09 15:10:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:10:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:10:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:10:57,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:10:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:10:57,992 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:11:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:11:12,192 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2025-01-09 15:11:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:11:12,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-01-09 15:11:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:11:12,194 INFO L225 Difference]: With dead ends: 140 [2025-01-09 15:11:12,194 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:11:12,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:11:12,196 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 70 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:11:12,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 437 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 15:11:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:11:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2025-01-09 15:11:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 15:11:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-01-09 15:11:12,212 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 92 [2025-01-09 15:11:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:11:12,212 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-01-09 15:11:12,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 15:11:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-01-09 15:11:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 15:11:12,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:11:12,213 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:12,220 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 15:11:12,414 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 15:11:12,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:11:12,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:11:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1252892078, now seen corresponding path program 1 times [2025-01-09 15:11:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:11:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468399060] [2025-01-09 15:11:12,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:11:12,416 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 15:11:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:11:12,418 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 15:11:12,420 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 15:11:12,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 15:11:12,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 15:11:12,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:11:12,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:11:12,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 15:11:12,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:11:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 15:11:22,876 INFO L312 TraceCheckSpWp]: Computing backward predicates...