./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-3.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 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:10:16,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:10:16,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:10:16,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:10:16,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:10:16,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:10:16,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:10:16,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:10:16,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:10:16,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:10:16,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:10:16,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:10:16,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:10:16,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:10:16,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:10:16,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:10:16,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:10:16,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:10:16,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:10:16,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:10:16,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:10:16,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:10:16,213 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 -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2025-03-17 05:10:16,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:10:16,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:10:16,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:10:16,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:10:16,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:10:16,446 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-3.i [2025-03-17 05:10:17,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6352e9ac1/ea0e3438537243ab89dce7d39289dfc8/FLAG104e7b052 [2025-03-17 05:10:17,929 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:10:17,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2025-03-17 05:10:17,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6352e9ac1/ea0e3438537243ab89dce7d39289dfc8/FLAG104e7b052 [2025-03-17 05:10:18,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6352e9ac1/ea0e3438537243ab89dce7d39289dfc8 [2025-03-17 05:10:18,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:10:18,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:10:18,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:10:18,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:10:18,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:10:18,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18, skipping insertion in model container [2025-03-17 05:10:18,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:10:18,326 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-3.i[912,925] [2025-03-17 05:10:18,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:10:18,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:10:18,386 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-3.i[912,925] [2025-03-17 05:10:18,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:10:18,423 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:10:18,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18 WrapperNode [2025-03-17 05:10:18,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:10:18,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:10:18,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:10:18,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:10:18,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,464 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-17 05:10:18,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:10:18,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:10:18,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:10:18,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:10:18,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,491 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-17 05:10:18,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:10:18,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:10:18,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:10:18,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:10:18,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (1/1) ... [2025-03-17 05:10:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:10:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:10:18,533 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-17 05:10:18,535 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-17 05:10:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:10:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:10:18,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:10:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:10:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:10:18,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:10:18,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:10:18,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:10:18,776 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 05:10:18,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:10:18,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:10:18,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:10:18,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:10:18 BoogieIcfgContainer [2025-03-17 05:10:18,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:10:18,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:10:18,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:10:18,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:10:18,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:10:18" (1/3) ... [2025-03-17 05:10:18,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c11fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:10:18, skipping insertion in model container [2025-03-17 05:10:18,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:18" (2/3) ... [2025-03-17 05:10:18,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c11fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:10:18, skipping insertion in model container [2025-03-17 05:10:18,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:10:18" (3/3) ... [2025-03-17 05:10:18,796 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2025-03-17 05:10:18,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:10:18,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-3.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:10:18,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:10:18,857 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;@1f35a57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:10:18,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:10:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:10:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:18,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:18,869 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:18,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:18,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -466328932, now seen corresponding path program 1 times [2025-03-17 05:10:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:10:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35218850] [2025-03-17 05:10:18,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:10:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:18,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:18,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:18,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:10:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:10:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35218850] [2025-03-17 05:10:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35218850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:10:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145780069] [2025-03-17 05:10:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:19,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:10:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:10:19,063 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-17 05:10:19,064 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-17 05:10:19,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:19,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:19,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:19,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:19,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:10:19,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:10:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:10:19,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:10:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145780069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:10:19,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:10:19,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:10:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615364215] [2025-03-17 05:10:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:10:19,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:10:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:10:19,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:10:19,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:10:19,218 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:10:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:19,238 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2025-03-17 05:10:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:10:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-17 05:10:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:19,244 INFO L225 Difference]: With dead ends: 89 [2025-03-17 05:10:19,245 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 05:10:19,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-17 05:10:19,248 INFO L435 NwaCegarLoop]: 65 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, 65 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-17 05:10:19,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:10:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 05:10:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 05:10:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:10:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 05:10:19,276 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 100 [2025-03-17 05:10:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:19,276 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 05:10:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:10:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 05:10:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:19,281 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:19,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:10:19,481 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-17 05:10:19,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:19,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 438538392, now seen corresponding path program 1 times [2025-03-17 05:10:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:10:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-17 05:10:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:10:19,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:19,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:19,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:10:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:10:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73071222] [2025-03-17 05:10:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73071222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:10:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:10:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:10:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470950665] [2025-03-17 05:10:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:10:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:10:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:10:19,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:10:19,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:10:19,793 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:10:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:19,829 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2025-03-17 05:10:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:10:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-17 05:10:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:19,832 INFO L225 Difference]: With dead ends: 130 [2025-03-17 05:10:19,833 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:10:19,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:10:19,835 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 31 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:10:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:10:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:10:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-17 05:10:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:10:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2025-03-17 05:10:19,855 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 100 [2025-03-17 05:10:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2025-03-17 05:10:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:10:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2025-03-17 05:10:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:19,858 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:10:19,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 439461913, now seen corresponding path program 1 times [2025-03-17 05:10:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:10:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-17 05:10:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:10:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:19,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:19,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:10:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:10:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-17 05:10:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729601047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:10:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727269897] [2025-03-17 05:10:20,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:20,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:10:20,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:10:20,081 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-17 05:10:20,082 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-17 05:10:20,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:20,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:20,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:20,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:10:20,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:10:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:10:20,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:10:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:10:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727269897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:10:20,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:10:20,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 05:10:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167179479] [2025-03-17 05:10:20,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:10:20,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:10:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:10:20,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:10:20,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:10:20,580 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 05:10:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:20,730 INFO L93 Difference]: Finished difference Result 183 states and 263 transitions. [2025-03-17 05:10:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:10:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 100 [2025-03-17 05:10:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:20,735 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:10:20,735 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:10:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:10:20,736 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:10:20,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:10:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:10:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2025-03-17 05:10:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:10:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2025-03-17 05:10:20,749 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 100 [2025-03-17 05:10:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:20,750 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-03-17 05:10:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 05:10:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2025-03-17 05:10:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:20,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:20,751 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:20,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:10:20,956 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,SelfDestructingSolverStorable2 [2025-03-17 05:10:20,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 439491704, now seen corresponding path program 1 times [2025-03-17 05:10:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:10:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-17 05:10:20,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:10:20,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:20,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:20,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:10:20,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:10:20,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:21,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:21,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:21,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:10:21,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:10:21,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:10:21,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:10:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:10:21,067 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:10:21,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:10:21,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:10:21 BoogieIcfgContainer [2025-03-17 05:10:21,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:10:21,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:10:21,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:10:21,132 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:10:21,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:10:18" (3/4) ... [2025-03-17 05:10:21,135 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:10:21,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:10:21,137 INFO L158 Benchmark]: Toolchain (without parser) took 2941.35ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 57.0MB in the end (delta: 64.8MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-03-17 05:10:21,137 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:10:21,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:10:21,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.15ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:10:21,138 INFO L158 Benchmark]: Boogie Preprocessor took 36.77ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 104.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:10:21,138 INFO L158 Benchmark]: IcfgBuilder took 286.76ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 88.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:10:21,139 INFO L158 Benchmark]: TraceAbstraction took 2340.87ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 57.1MB in the end (delta: 30.9MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2025-03-17 05:10:21,139 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 167.8MB. Free memory was 57.1MB in the beginning and 57.0MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:10:21,140 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.23ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.15ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.77ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 104.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.76ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 88.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2340.87ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 57.1MB in the end (delta: 30.9MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 167.8MB. Free memory was 57.1MB in the beginning and 57.0MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. 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 someUnaryDOUBLEoperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 15.75; [L33] double var_1_14 = -0.5; [L34] double var_1_15 = 5.25; [L35] double var_1_16 = 8.5; [L36] unsigned char last_1_var_1_11 = 1; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_11 = var_1_11 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L80] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L81] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L86] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L88] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L90] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L91] var_1_16 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L92] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L106] RET updateVariables() [L107] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L41] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L48] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, var_1_10=536870911, var_1_11=1, var_1_12=536870917, var_1_15=536870917, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((double) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((double) var_1_15))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=536870917, var_1_15=536870917, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=536870911, var_1_11=1, var_1_12=536870917, var_1_15=536870917, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 85 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 283 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 171 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 1 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2724/2880 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-17 05:10:21,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-3.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 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:10:23,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:10:23,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:10:23,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:10:23,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:10:23,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:10:23,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:10:23,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:10:23,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:10:23,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:10:23,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:10:23,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:10:23,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:10:23,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:10:23,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:10:23,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:10:23,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:10:23,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:10:23,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:10:23,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:10:23,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:10:23,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:10:23,215 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 -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2025-03-17 05:10:23,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:10:23,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:10:23,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:10:23,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:10:23,482 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:10:23,484 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-3.i [2025-03-17 05:10:24,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7cd32fb/4618d1c572a04fc190dbad99447cea81/FLAG5a50df60e [2025-03-17 05:10:24,864 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:10:24,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2025-03-17 05:10:24,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7cd32fb/4618d1c572a04fc190dbad99447cea81/FLAG5a50df60e [2025-03-17 05:10:24,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7cd32fb/4618d1c572a04fc190dbad99447cea81 [2025-03-17 05:10:24,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:10:24,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:10:24,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:10:24,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:10:24,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:10:24,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:10:24" (1/1) ... [2025-03-17 05:10:24,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e18577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:24, skipping insertion in model container [2025-03-17 05:10:24,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:10:24" (1/1) ... [2025-03-17 05:10:24,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:10:25,012 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-3.i[912,925] [2025-03-17 05:10:25,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:10:25,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:10:25,087 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-3.i[912,925] [2025-03-17 05:10:25,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:10:25,129 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:10:25,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25 WrapperNode [2025-03-17 05:10:25,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:10:25,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:10:25,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:10:25,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:10:25,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,162 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 05:10:25,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:10:25,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:10:25,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:10:25,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:10:25,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,188 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-17 05:10:25,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:10:25,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:10:25,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:10:25,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:10:25,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (1/1) ... [2025-03-17 05:10:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:10:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:10:25,232 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-17 05:10:25,235 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-17 05:10:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:10:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:10:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:10:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:10:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:10:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:10:25,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:10:25,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:10:25,845 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 05:10:25,845 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:10:25,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:10:25,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:10:25,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:10:25 BoogieIcfgContainer [2025-03-17 05:10:25,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:10:25,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:10:25,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:10:25,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:10:25,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:10:24" (1/3) ... [2025-03-17 05:10:25,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fb8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:10:25, skipping insertion in model container [2025-03-17 05:10:25,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:10:25" (2/3) ... [2025-03-17 05:10:25,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fb8daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:10:25, skipping insertion in model container [2025-03-17 05:10:25,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:10:25" (3/3) ... [2025-03-17 05:10:25,861 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2025-03-17 05:10:25,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:10:25,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-3.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:10:25,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:10:25,921 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;@393ea7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:10:25,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:10:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:10:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:25,932 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:25,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -466328932, now seen corresponding path program 1 times [2025-03-17 05:10:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:10:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655932243] [2025-03-17 05:10:25,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:25,944 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-17 05:10:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:10:25,946 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-17 05:10:25,947 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-17 05:10:26,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:26,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:26,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:26,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:26,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:10:26,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:10:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-17 05:10:26,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:10:26,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:10:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655932243] [2025-03-17 05:10:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655932243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:10:26,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:10:26,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:10:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94294988] [2025-03-17 05:10:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:10:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:10:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:10:26,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:10:26,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:10:26,192 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:10:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:26,219 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2025-03-17 05:10:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:10:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-17 05:10:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:26,224 INFO L225 Difference]: With dead ends: 89 [2025-03-17 05:10:26,224 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 05:10:26,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-17 05:10:26,228 INFO L435 NwaCegarLoop]: 65 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, 65 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-17 05:10:26,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:10:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 05:10:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 05:10:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:10:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 05:10:26,255 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 100 [2025-03-17 05:10:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:26,255 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 05:10:26,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:10:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 05:10:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:26,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:26,260 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:26,269 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-17 05:10:26,461 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-17 05:10:26,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:26,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash 438538392, now seen corresponding path program 1 times [2025-03-17 05:10:26,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:10:26,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838077602] [2025-03-17 05:10:26,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:26,463 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-17 05:10:26,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:10:26,465 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-17 05:10:26,466 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-17 05:10:26,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:26,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:26,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:10:26,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:10:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:10:26,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:10:26,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:10:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838077602] [2025-03-17 05:10:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838077602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:10:26,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:10:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:10:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936995133] [2025-03-17 05:10:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:10:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:10:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:10:26,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:10:26,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:10:26,865 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:10:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:27,116 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2025-03-17 05:10:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:10:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-17 05:10:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:27,119 INFO L225 Difference]: With dead ends: 130 [2025-03-17 05:10:27,119 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:10:27,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:10:27,120 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:10:27,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:10:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:10:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-17 05:10:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:10:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2025-03-17 05:10:27,139 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 100 [2025-03-17 05:10:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2025-03-17 05:10:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:10:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2025-03-17 05:10:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:27,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:27,143 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:27,150 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-17 05:10:27,343 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-17 05:10:27,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:27,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 439461913, now seen corresponding path program 1 times [2025-03-17 05:10:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:10:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811111905] [2025-03-17 05:10:27,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:27,345 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-17 05:10:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:10:27,347 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-17 05:10:27,348 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-17 05:10:27,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:27,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:27,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:10:27,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:10:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:10:27,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:10:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:10:27,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:10:27,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811111905] [2025-03-17 05:10:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811111905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:10:27,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:10:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 05:10:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253829969] [2025-03-17 05:10:27,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:10:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:10:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:10:27,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:10:27,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:10:27,881 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 05:10:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:10:28,353 INFO L93 Difference]: Finished difference Result 183 states and 263 transitions. [2025-03-17 05:10:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:10:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 100 [2025-03-17 05:10:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:10:28,363 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:10:28,364 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 05:10:28,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:10:28,365 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:10:28,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:10:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 05:10:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2025-03-17 05:10:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:10:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2025-03-17 05:10:28,383 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 100 [2025-03-17 05:10:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:10:28,384 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-03-17 05:10:28,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 05:10:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2025-03-17 05:10:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:10:28,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:10:28,385 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:10:28,393 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 (4)] Ended with exit code 0 [2025-03-17 05:10:28,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-17 05:10:28,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:10:28,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:10:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 439491704, now seen corresponding path program 1 times [2025-03-17 05:10:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:10:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733031559] [2025-03-17 05:10:28,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:10:28,587 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-17 05:10:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:10:28,588 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 05:10:28,590 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 (5)] Waiting until timeout for monitored process [2025-03-17 05:10:28,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:10:28,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:10:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:10:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:10:28,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:10:28,736 INFO L279 TraceCheckSpWp]: Computing forward predicates...