./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.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-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:14:49,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:14:49,357 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:14:49,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:14:49,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:14:49,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:14:49,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:14:49,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:14:49,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:14:49,394 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:14:49,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:14:49,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:14:49,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:14:49,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:14:49,395 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:14:49,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:14:49,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:14:49,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:49,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:49,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:49,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:14:49,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:14:49,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:14:49,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:14:49,399 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 -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2025-01-09 15:14:49,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:14:49,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:14:49,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:14:49,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:14:49,705 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:14:49,706 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-81.i [2025-01-09 15:14:51,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39125d90d/fb8e7f57ab704bf190c972d582e8e037/FLAG3073a339b [2025-01-09 15:14:51,316 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:14:51,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2025-01-09 15:14:51,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39125d90d/fb8e7f57ab704bf190c972d582e8e037/FLAG3073a339b [2025-01-09 15:14:51,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39125d90d/fb8e7f57ab704bf190c972d582e8e037 [2025-01-09 15:14:51,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:14:51,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:14:51,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:51,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:14:51,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:14:51,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120706b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51, skipping insertion in model container [2025-01-09 15:14:51,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:14:51,491 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-81.i[913,926] [2025-01-09 15:14:51,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:51,547 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:14:51,558 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-81.i[913,926] [2025-01-09 15:14:51,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:51,587 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:14:51,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51 WrapperNode [2025-01-09 15:14:51,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:51,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:51,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:14:51,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:14:51,595 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:14:51" (1/1) ... [2025-01-09 15:14:51,602 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:14:51" (1/1) ... [2025-01-09 15:14:51,631 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 15:14:51,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:51,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:14:51,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:14:51,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:14:51,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,653 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:14:51,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:14:51,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:14:51,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:14:51,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:14:51,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (1/1) ... [2025-01-09 15:14:51,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:51,722 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:14:51,726 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:14:51,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:14:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:14:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:14:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:14:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:14:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:14:51,825 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:14:51,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:14:52,082 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 15:14:52,082 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:14:52,091 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:14:52,091 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:14:52,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:52 BoogieIcfgContainer [2025-01-09 15:14:52,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:14:52,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:14:52,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:14:52,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:14:52,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:51" (1/3) ... [2025-01-09 15:14:52,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8078d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:52, skipping insertion in model container [2025-01-09 15:14:52,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:51" (2/3) ... [2025-01-09 15:14:52,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8078d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:52, skipping insertion in model container [2025-01-09 15:14:52,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:52" (3/3) ... [2025-01-09 15:14:52,103 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2025-01-09 15:14:52,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:14:52,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-81.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:14:52,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:14:52,206 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;@670fd258, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:14:52,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:14:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:14:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:14:52,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:52,220 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:52,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:52,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash -19506628, now seen corresponding path program 1 times [2025-01-09 15:14:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879962892] [2025-01-09 15:14:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:52,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:14:52,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:14:52,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:52,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:14:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879962892] [2025-01-09 15:14:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879962892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:14:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649321148] [2025-01-09 15:14:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:14:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:52,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:14:52,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:14:52,851 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:14:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:53,136 INFO L93 Difference]: Finished difference Result 187 states and 322 transitions. [2025-01-09 15:14:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:14:53,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 15:14:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:53,150 INFO L225 Difference]: With dead ends: 187 [2025-01-09 15:14:53,151 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:14:53,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:14:53,160 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 69 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:53,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 237 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:14:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:14:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2025-01-09 15:14:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:14:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-01-09 15:14:53,277 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 119 [2025-01-09 15:14:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-01-09 15:14:53,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:14:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-01-09 15:14:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:14:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:53,286 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 15:14:53,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1691474012, now seen corresponding path program 1 times [2025-01-09 15:14:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958047802] [2025-01-09 15:14:53,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:53,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:14:53,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:14:53,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:53,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:14:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:14:53,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:14:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958047802] [2025-01-09 15:14:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958047802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:14:53,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:14:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:14:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469378284] [2025-01-09 15:14:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:14:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:14:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:14:53,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:14:53,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:14:53,572 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:14:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:14:53,762 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2025-01-09 15:14:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:14:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-01-09 15:14:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:14:53,766 INFO L225 Difference]: With dead ends: 197 [2025-01-09 15:14:53,766 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 15:14:53,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:14:53,768 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:14:53,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 245 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:14:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 15:14:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2025-01-09 15:14:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:14:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-01-09 15:14:53,799 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 120 [2025-01-09 15:14:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:14:53,799 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-01-09 15:14:53,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:14:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-01-09 15:14:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:14:53,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:14:53,802 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:14:53,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:14:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:14:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1892137087, now seen corresponding path program 1 times [2025-01-09 15:14:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:14:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086267426] [2025-01-09 15:14:53,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:14:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:14:53,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:14:53,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:14:53,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:53,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:14:53,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:14:53,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:14:53,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:14:53,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:14:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:14:54,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:14:54,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:14:54,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:14:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:14:54,053 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:14:54,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:14:54,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:14:54 BoogieIcfgContainer [2025-01-09 15:14:54,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:14:54,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:14:54,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:14:54,150 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:14:54,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:52" (3/4) ... [2025-01-09 15:14:54,154 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:14:54,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:14:54,156 INFO L158 Benchmark]: Toolchain (without parser) took 2807.45ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 125.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-01-09 15:14:54,156 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:54,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.15ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 120.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:54,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.68ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:14:54,156 INFO L158 Benchmark]: Boogie Preprocessor took 53.36ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:54,157 INFO L158 Benchmark]: RCFGBuilder took 405.61ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 95.9MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:14:54,157 INFO L158 Benchmark]: TraceAbstraction took 2055.22ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 125.1MB in the end (delta: -30.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-01-09 15:14:54,157 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 125.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:14:54,160 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.15ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 120.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.68ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 117.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.36ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 405.61ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 95.9MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2055.22ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 125.1MB in the end (delta: -30.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 125.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of bitwiseOr at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; VAL [isInitial=0, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] isInitial = 1 [L111] FCALL initially() [L113] CALL updateLastVariables() [L102] last_1_var_1_13 = var_1_13 [L103] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] var_1_4 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] var_1_5 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L79] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_6=9999999999993/10, var_1_7=-128] [L80] var_1_6 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L81] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L82] var_1_11 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L83] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L86] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L95] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L98] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-63] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=-63, var_1_12=-63, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-63] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-63] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-63, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=19999/2, var_1_2=1, var_1_7=-63] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=19999/2, var_1_2=1, var_1_7=-63] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-63] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-63] [L106-L107] return (((var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=-63, var_1_12=-63, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=-49153, var_1_17=0, var_1_18=100, var_1_1=1000000000004, var_1_2=1, var_1_3=1000000000004, var_1_7=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 314 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 168 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=1, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 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:14:54,179 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-81.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 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:14:56,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:14:56,692 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:14:56,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:14:56,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:14:56,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:14:56,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:14:56,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:14:56,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:14:56,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:14:56,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:14:56,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:14:56,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:14:56,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:14:56,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:14:56,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:14:56,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:56,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:56,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:14:56,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:56,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:14:56,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:14:56,745 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 -> 7ee9ab0ce6c16857f5101fdd21f4b28f23af496d642a804f890a8c51cd803df8 [2025-01-09 15:14:57,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:14:57,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:14:57,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:14:57,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:14:57,092 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:14:57,093 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-81.i [2025-01-09 15:14:58,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723435eed/1c6ce0b862e3417292f126b2c4c088d9/FLAG120dec972 [2025-01-09 15:14:58,729 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:14:58,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-81.i [2025-01-09 15:14:58,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723435eed/1c6ce0b862e3417292f126b2c4c088d9/FLAG120dec972 [2025-01-09 15:14:58,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/723435eed/1c6ce0b862e3417292f126b2c4c088d9 [2025-01-09 15:14:58,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:14:58,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:14:58,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:58,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:14:58,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:14:58,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:58" (1/1) ... [2025-01-09 15:14:58,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532758bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:58, skipping insertion in model container [2025-01-09 15:14:58,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:58" (1/1) ... [2025-01-09 15:14:58,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:14:58,920 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-81.i[913,926] [2025-01-09 15:14:58,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:58,975 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:14:58,984 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-81.i[913,926] [2025-01-09 15:14:59,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:14:59,028 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:14:59,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59 WrapperNode [2025-01-09 15:14:59,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:14:59,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:59,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:14:59,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:14:59,037 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:14:59" (1/1) ... [2025-01-09 15:14:59,050 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:14:59" (1/1) ... [2025-01-09 15:14:59,073 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 15:14:59,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:14:59,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:14:59,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:14:59,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:14:59,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,112 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:14:59,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:14:59,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:14:59,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:14:59,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:14:59,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (1/1) ... [2025-01-09 15:14:59,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:14:59,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:14:59,169 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:14:59,173 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:14:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:14:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:14:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:14:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:14:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:14:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:14:59,285 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:14:59,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:15:02,917 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 15:15:02,918 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:15:02,928 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:15:02,928 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:15:02,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:15:02 BoogieIcfgContainer [2025-01-09 15:15:02,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:15:02,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:15:02,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:15:02,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:15:02,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:58" (1/3) ... [2025-01-09 15:15:02,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ba050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:15:02, skipping insertion in model container [2025-01-09 15:15:02,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:59" (2/3) ... [2025-01-09 15:15:02,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ba050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:15:02, skipping insertion in model container [2025-01-09 15:15:02,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:15:02" (3/3) ... [2025-01-09 15:15:02,937 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-81.i [2025-01-09 15:15:02,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:15:02,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-81.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:15:02,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:15:03,004 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;@4ff2d699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:15:03,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:15:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:15:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:15:03,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:15:03,017 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:15:03,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:15:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash -167786894, now seen corresponding path program 1 times [2025-01-09 15:15:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:15:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187786898] [2025-01-09 15:15:03,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:15:03,029 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:15:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:15:03,032 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:15:03,033 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:15:03,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:15:03,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:15:03,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:15:03,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:15:03,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:15:03,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:15:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-01-09 15:15:03,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:15:03,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:15:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187786898] [2025-01-09 15:15:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187786898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:15:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:15:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:15:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898909283] [2025-01-09 15:15:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:15:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:15:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:15:03,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:15:03,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:15:03,346 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:15:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:15:03,386 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2025-01-09 15:15:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:15:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-01-09 15:15:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:15:03,393 INFO L225 Difference]: With dead ends: 104 [2025-01-09 15:15:03,393 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 15:15:03,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:15:03,400 INFO L435 NwaCegarLoop]: 75 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, 75 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:15:03,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:15:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 15:15:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 15:15:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:15:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-01-09 15:15:03,445 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 116 [2025-01-09 15:15:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:15:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-09 15:15:03,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:15:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-01-09 15:15:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 15:15:03,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:15:03,449 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,459 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:15:03,650 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:15:03,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:15:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:15:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1469510358, now seen corresponding path program 1 times [2025-01-09 15:15:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:15:03,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780163669] [2025-01-09 15:15:03,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:15:03,652 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:15:03,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:15:03,654 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:15:03,655 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:15:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 15:15:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 15:15:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:15:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:15:03,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:15:03,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:15:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:15:04,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:15:04,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:15:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780163669] [2025-01-09 15:15:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780163669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:15:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:15:04,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:15:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563324089] [2025-01-09 15:15:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:15:04,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:15:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:15:04,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:15:04,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:15:04,855 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:15:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:15:07,179 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2025-01-09 15:15:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:15:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-01-09 15:15:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:15:07,194 INFO L225 Difference]: With dead ends: 151 [2025-01-09 15:15:07,194 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:15:07,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:15:07,195 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 41 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:15:07,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 236 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 15:15:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:15:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2025-01-09 15:15:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:15:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-01-09 15:15:07,218 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 116 [2025-01-09 15:15:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:15:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-01-09 15:15:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:15:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-01-09 15:15:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:15:07,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:15:07,221 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,231 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:15:07,421 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:15:07,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:15:07,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:15:07,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1323338688, now seen corresponding path program 1 times [2025-01-09 15:15:07,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:15:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702054272] [2025-01-09 15:15:07,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:15:07,423 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:15:07,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:15:07,428 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:15:07,429 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:15:07,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:15:07,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:15:07,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:15:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:15:07,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:15:07,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:15:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:15:07,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:15:07,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:15:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702054272] [2025-01-09 15:15:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702054272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:15:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:15:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:15:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101171180] [2025-01-09 15:15:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:15:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:15:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:15:07,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:15:07,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:15:07,680 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:15:09,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:15:10,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:15:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:15:10,082 INFO L93 Difference]: Finished difference Result 151 states and 218 transitions. [2025-01-09 15:15:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:15:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2025-01-09 15:15:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:15:10,085 INFO L225 Difference]: With dead ends: 151 [2025-01-09 15:15:10,085 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:15:10,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:15:10,086 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:15:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 15:15:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:15:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2025-01-09 15:15:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:15:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2025-01-09 15:15:10,105 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 117 [2025-01-09 15:15:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:15:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2025-01-09 15:15:10,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:15:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2025-01-09 15:15:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:15:10,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:15:10,107 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:15:10,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:15:10,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:15:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:15:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1325185730, now seen corresponding path program 1 times [2025-01-09 15:15:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:15:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711434875] [2025-01-09 15:15:10,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:15:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:15:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:15:10,312 INFO L229 MonitoredProcess]: Starting monitored process 5 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:15:10,319 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 (5)] Waiting until timeout for monitored process [2025-01-09 15:15:10,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:15:10,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:15:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:15:10,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:15:10,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:15:10,543 INFO L279 TraceCheckSpWp]: Computing forward predicates...