./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 80b1310bfd0ebb1f8adee6a07bb0f77a4784a083406c8d78ad068fae1e450221 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:09:29,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:09:29,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:09:29,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:09:29,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:09:29,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:09:29,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:09:29,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:09:29,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:09:29,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:09:29,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:09:29,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:09:29,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:09:29,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:09:29,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:09:29,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:09:29,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:09:29,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:09:29,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:29,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:09:29,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:09:29,942 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/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 -> 80b1310bfd0ebb1f8adee6a07bb0f77a4784a083406c8d78ad068fae1e450221 [2025-03-08 16:09:30,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:09:30,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:09:30,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:09:30,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:09:30,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:09:30,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:31,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812e66d95/2461e04c3f4244d796754b8c2b00e7e1/FLAGc0dde52ac [2025-03-08 16:09:31,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:09:31,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:31,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812e66d95/2461e04c3f4244d796754b8c2b00e7e1/FLAGc0dde52ac [2025-03-08 16:09:31,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812e66d95/2461e04c3f4244d796754b8c2b00e7e1 [2025-03-08 16:09:31,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:09:31,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:09:31,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:31,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:09:31,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:09:31,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:31" (1/1) ... [2025-03-08 16:09:31,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cac7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:31, skipping insertion in model container [2025-03-08 16:09:31,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:31" (1/1) ... [2025-03-08 16:09:31,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:09:32,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i[913,926] [2025-03-08 16:09:32,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:32,034 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:09:32,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i[913,926] [2025-03-08 16:09:32,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:32,067 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:09:32,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32 WrapperNode [2025-03-08 16:09:32,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:32,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:32,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:09:32,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:09:32,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,096 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 16:09:32,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:32,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:09:32,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:09:32,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:09:32,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,114 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-03-08 16:09:32,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:09:32,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:09:32,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:09:32,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:09:32,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (1/1) ... [2025-03-08 16:09:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:32,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:09:32,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:09:32,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:09:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:09:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:09:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:09:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:09:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:09:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:09:32,237 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:09:32,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:09:32,447 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 16:09:32,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:09:32,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:09:32,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:09:32,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:32 BoogieIcfgContainer [2025-03-08 16:09:32,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:09:32,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:09:32,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:09:32,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:09:32,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:09:31" (1/3) ... [2025-03-08 16:09:32,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f826a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:32, skipping insertion in model container [2025-03-08 16:09:32,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:32" (2/3) ... [2025-03-08 16:09:32,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f826a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:32, skipping insertion in model container [2025-03-08 16:09:32,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:32" (3/3) ... [2025-03-08 16:09:32,462 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:32,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:09:32,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-72.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:09:32,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:09:32,519 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;@35beb878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:09:32,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:09:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:09:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:09:32,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:32,533 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:09:32,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:32,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1148143783, now seen corresponding path program 1 times [2025-03-08 16:09:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:09:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779239654] [2025-03-08 16:09:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:09:32,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:32,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:09:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:09:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779239654] [2025-03-08 16:09:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779239654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:09:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137054475] [2025-03-08 16:09:32,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:32,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:09:32,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:09:32,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:09:32,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:09:32,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:32,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:09:32,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:09:32,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:32,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137054475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:32,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:09:32,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:09:32,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290341578] [2025-03-08 16:09:32,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:32,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:09:32,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:09:32,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:09:32,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:09:32,915 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:09:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:32,931 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions. [2025-03-08 16:09:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:09:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 16:09:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:32,937 INFO L225 Difference]: With dead ends: 94 [2025-03-08 16:09:32,938 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 16:09:32,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-03-08 16:09:32,942 INFO L435 NwaCegarLoop]: 67 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, 67 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-03-08 16:09:32,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:09:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 16:09:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 16:09:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:09:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-03-08 16:09:32,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 108 [2025-03-08 16:09:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-03-08 16:09:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:09:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-03-08 16:09:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:09:32,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:32,971 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:09:32,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:09:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:09:33,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1608600854, now seen corresponding path program 1 times [2025-03-08 16:09:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:09:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887143052] [2025-03-08 16:09:33,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:09:33,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:33,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:33,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:33,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:09:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:09:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887143052] [2025-03-08 16:09:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887143052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:09:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820622393] [2025-03-08 16:09:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:09:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:09:33,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:09:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:09:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:33,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:33,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:09:33,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 16:09:33,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:09:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:09:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820622393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:09:34,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:09:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 16:09:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498747094] [2025-03-08 16:09:34,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:09:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:09:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:09:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:09:34,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:09:34,045 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 16:09:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:34,184 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-08 16:09:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:09:34,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2025-03-08 16:09:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:34,186 INFO L225 Difference]: With dead ends: 99 [2025-03-08 16:09:34,186 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 16:09:34,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:09:34,186 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:09:34,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 99 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:09:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 16:09:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-08 16:09:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:09:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-03-08 16:09:34,202 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 108 [2025-03-08 16:09:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-08 16:09:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 16:09:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-03-08 16:09:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:09:34,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:34,205 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:09:34,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:09:34,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 16:09:34,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -943556107, now seen corresponding path program 1 times [2025-03-08 16:09:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:09:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979797417] [2025-03-08 16:09:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:09:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:34,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:09:34,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:09:34,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:34,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:34,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:09:34,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:09:34,544 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:09:34,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:09:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:09:34,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 16:09:34,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:09:34,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:09:34 BoogieIcfgContainer [2025-03-08 16:09:34,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:09:34,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:09:34,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:09:34,606 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:09:34,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:32" (3/4) ... [2025-03-08 16:09:34,609 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:09:34,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:09:34,610 INFO L158 Benchmark]: Toolchain (without parser) took 2718.01ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 99.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2025-03-08 16:09:34,610 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:09:34,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.28ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:09:34,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.76ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:09:34,610 INFO L158 Benchmark]: Boogie Preprocessor took 25.24ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:09:34,611 INFO L158 Benchmark]: IcfgBuilder took 332.16ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:09:34,611 INFO L158 Benchmark]: TraceAbstraction took 2149.45ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 99.4MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:09:34,611 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 99.4MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:09:34,612 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.98ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.28ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.76ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.24ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 332.16ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 90.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2149.45ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 99.4MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 99.4MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_8 = 1; [L25] unsigned char var_1_9 = 0; [L26] unsigned long int var_1_10 = 2; [L27] signed char var_1_11 = -16; [L28] signed char var_1_12 = -2; [L29] signed char var_1_13 = -10; [L30] signed char var_1_14 = 4; [L31] double var_1_15 = 256.4; [L32] float var_1_16 = 0.25; [L33] double var_1_17 = 100000000000.2; [L34] double var_1_18 = 50.5; [L35] double var_1_19 = 9.5; [L36] double var_1_20 = 100000000000.4; [L37] signed char var_1_21 = 4; [L38] unsigned short int var_1_22 = 10000; [L39] unsigned char last_1_var_1_1 = 1; [L40] double last_1_var_1_15 = 256.4; VAL [isInitial=0, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=0, var_1_8=1, var_1_9=0] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 [L93] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L66] var_1_8 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L69] var_1_9 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_14 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L84] var_1_17 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_18 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L88] var_1_19 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L104] RET updateVariables() [L105] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_20=500000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) [L48] var_1_20 = var_1_19 [L49] var_1_21 = 1 [L50] var_1_22 = 10 VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=1, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L51] COND FALSE !((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=1, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L58] COND TRUE var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L59] var_1_1 = (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=0, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) ? ((var_1_20 >= last_1_var_1_15) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) ((((var_1_17) < ((5.75 + var_1_19))) ? (var_1_17) : ((5.75 + var_1_19))))))) : 1)) && (var_1_20 == ((double) var_1_19))) && (var_1_21 == ((signed char) 1))) && (var_1_22 == ((unsigned short int) 10)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=0, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=0, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=0, var_1_14=126, var_1_15=1282/5, var_1_19=100000000005, var_1_1=0, var_1_20=100000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 89 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 111 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 1 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2589/2720 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-03-08 16:09:34,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 80b1310bfd0ebb1f8adee6a07bb0f77a4784a083406c8d78ad068fae1e450221 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:09:36,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:09:36,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:09:36,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:09:36,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:09:36,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:09:36,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:09:36,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:09:36,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:09:36,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:09:36,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:09:36,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:09:36,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:09:36,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:09:36,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:09:36,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:09:36,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:09:36,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:09:36,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:36,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:09:36,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:09:36,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:09:36,580 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/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 -> 80b1310bfd0ebb1f8adee6a07bb0f77a4784a083406c8d78ad068fae1e450221 [2025-03-08 16:09:36,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:09:36,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:09:36,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:09:36,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:09:36,797 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:09:36,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:38,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81120874/0d7586f861cc407f85ae5a9767dfb4f2/FLAG6d09a2128 [2025-03-08 16:09:38,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:09:38,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:38,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81120874/0d7586f861cc407f85ae5a9767dfb4f2/FLAG6d09a2128 [2025-03-08 16:09:38,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81120874/0d7586f861cc407f85ae5a9767dfb4f2 [2025-03-08 16:09:38,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:09:38,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:09:38,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:38,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:09:38,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:09:38,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b9fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38, skipping insertion in model container [2025-03-08 16:09:38,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:09:38,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i[913,926] [2025-03-08 16:09:38,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:38,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:09:38,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-72.i[913,926] [2025-03-08 16:09:38,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:09:38,489 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:09:38,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38 WrapperNode [2025-03-08 16:09:38,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:09:38,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:38,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:09:38,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:09:38,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,542 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-08 16:09:38,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:09:38,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:09:38,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:09:38,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:09:38,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,582 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-03-08 16:09:38,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:09:38,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:09:38,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:09:38,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:09:38,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (1/1) ... [2025-03-08 16:09:38,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:09:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:09:38,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:09:38,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:09:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:09:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:09:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:09:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:09:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:09:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:09:38,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:09:38,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:09:54,482 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 16:09:54,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:09:54,489 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:09:54,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:09:54,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:54 BoogieIcfgContainer [2025-03-08 16:09:54,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:09:54,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:09:54,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:09:54,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:09:54,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:09:38" (1/3) ... [2025-03-08 16:09:54,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd51f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:54, skipping insertion in model container [2025-03-08 16:09:54,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:09:38" (2/3) ... [2025-03-08 16:09:54,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd51f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:09:54, skipping insertion in model container [2025-03-08 16:09:54,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:09:54" (3/3) ... [2025-03-08 16:09:54,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-72.i [2025-03-08 16:09:54,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:09:54,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-72.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:09:54,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:09:54,558 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;@4eb489fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:09:54,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:09:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:09:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:09:54,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:54,573 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:09:54,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1148143783, now seen corresponding path program 1 times [2025-03-08 16:09:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469658696] [2025-03-08 16:09:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:54,585 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-03-08 16:09:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:54,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 16:09:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 16:09:54,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:55,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:55,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:55,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:55,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:09:55,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 16:09:55,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:09:55,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:09:55,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469658696] [2025-03-08 16:09:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469658696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:09:55,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:09:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:09:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807695431] [2025-03-08 16:09:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:09:55,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:09:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:09:55,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:09:55,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:09:55,688 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:09:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:09:55,713 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions. [2025-03-08 16:09:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:09:55,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 16:09:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:09:55,718 INFO L225 Difference]: With dead ends: 94 [2025-03-08 16:09:55,718 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 16:09:55,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-03-08 16:09:55,722 INFO L435 NwaCegarLoop]: 67 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, 67 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-03-08 16:09:55,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:09:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 16:09:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 16:09:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:09:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2025-03-08 16:09:55,746 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 108 [2025-03-08 16:09:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:09:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2025-03-08 16:09:55,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:09:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2025-03-08 16:09:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:09:55,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:09:55,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:09:55,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:09:55,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 16:09:55,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:09:55,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:09:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1608600854, now seen corresponding path program 1 times [2025-03-08 16:09:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:09:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098935686] [2025-03-08 16:09:55,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:09:55,951 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-03-08 16:09:55,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:09:55,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 16:09:55,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 16:09:55,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:09:56,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:09:56,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:09:56,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:09:56,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:09:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:09:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 16:09:59,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:10:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:10:01,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098935686] [2025-03-08 16:10:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098935686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:10:01,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:10:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 16:10:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716622748] [2025-03-08 16:10:01,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:10:01,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:10:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:10:01,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:10:01,284 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 16:10:08,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:10:12,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:10:16,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:10:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:16,427 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-08 16:10:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:10:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2025-03-08 16:10:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:16,548 INFO L225 Difference]: With dead ends: 99 [2025-03-08 16:10:16,548 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 16:10:16,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:10:16,549 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:16,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2025-03-08 16:10:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 16:10:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-08 16:10:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:10:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-03-08 16:10:16,558 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 108 [2025-03-08 16:10:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:16,558 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-08 16:10:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 16:10:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-03-08 16:10:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:10:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:16,560 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:10:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 16:10:16,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-08 16:10:16,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash -943556107, now seen corresponding path program 1 times [2025-03-08 16:10:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057709253] [2025-03-08 16:10:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:16,761 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-03-08 16:10:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:16,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-08 16:10:16,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 16:10:16,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:10:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:10:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:17,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:10:17,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:34,555 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 16:10:42,731 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 16:10:51,019 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 16:10:59,312 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 16:11:07,638 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 16:11:15,974 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)