./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.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 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:15:04,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:15:04,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:15:04,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:15:04,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:15:04,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:15:04,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:15:04,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:15:04,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:15:04,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:15:04,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:15:04,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:15:04,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:15:04,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:15:04,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:15:04,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:15:04,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:15:04,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:15:04,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:15:04,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:15:04,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:15:04,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:15:04,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:15:04,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:15:04,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:15:04,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:15:04,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:15:04,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:15:04,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:15:04,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:15:04,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:15:04,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:15:04,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:15:04,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:15:04,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:15:04,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:15:04,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:15:04,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:15:04,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:15:04,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:15:04,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:15:04,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:15:04,759 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 [2024-10-14 13:15:05,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:15:05,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:15:05,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:15:05,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:15:05,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:15:05,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:06,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:15:06,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:15:06,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:06,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d62bc3b/2486b19e79cb4dcab1ae574dec401f29/FLAGdbea9952c [2024-10-14 13:15:06,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d62bc3b/2486b19e79cb4dcab1ae574dec401f29 [2024-10-14 13:15:06,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:15:06,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:15:06,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:15:06,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:15:06,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:15:06,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:15:06" (1/1) ... [2024-10-14 13:15:06,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b496b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:06, skipping insertion in model container [2024-10-14 13:15:06,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:15:06" (1/1) ... [2024-10-14 13:15:06,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:15:06,922 WARN L248 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-53.i[913,926] [2024-10-14 13:15:06,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:15:07,017 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:15:07,029 WARN L248 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-53.i[913,926] [2024-10-14 13:15:07,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:15:07,081 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:15:07,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07 WrapperNode [2024-10-14 13:15:07,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:15:07,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:15:07,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:15:07,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:15:07,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,181 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-14 13:15:07,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:15:07,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:15:07,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:15:07,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:15:07,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,208 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]. [2024-10-14 13:15:07,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:15:07,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:15:07,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:15:07,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:15:07,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (1/1) ... [2024-10-14 13:15:07,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:15:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:15:07,274 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) [2024-10-14 13:15:07,281 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 [2024-10-14 13:15:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:15:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:15:07,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:15:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:15:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:15:07,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:15:07,413 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:15:07,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:15:07,653 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 13:15:07,654 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:15:07,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:15:07,698 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:15:07,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:15:07 BoogieIcfgContainer [2024-10-14 13:15:07,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:15:07,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:15:07,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:15:07,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:15:07,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:15:06" (1/3) ... [2024-10-14 13:15:07,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5f11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:15:07, skipping insertion in model container [2024-10-14 13:15:07,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:07" (2/3) ... [2024-10-14 13:15:07,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5f11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:15:07, skipping insertion in model container [2024-10-14 13:15:07,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:15:07" (3/3) ... [2024-10-14 13:15:07,709 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:07,730 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:15:07,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:15:07,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:15:07,786 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;@78a8d193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:15:07,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:15:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 13:15:07,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:07,807 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:07,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1140265954, now seen corresponding path program 1 times [2024-10-14 13:15:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:15:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524345517] [2024-10-14 13:15:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:15:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:15:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:15:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:15:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:15:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:15:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:15:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:15:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:15:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:15:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:15:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 13:15:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:15:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:15:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:15:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:15:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:15:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:15:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:15:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:15:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:15:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524345517] [2024-10-14 13:15:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524345517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:15:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:15:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:15:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519058514] [2024-10-14 13:15:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:15:08,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:15:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:15:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:15:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:15:08,217 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:15:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:15:08,251 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2024-10-14 13:15:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:15:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2024-10-14 13:15:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:15:08,264 INFO L225 Difference]: With dead ends: 93 [2024-10-14 13:15:08,264 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 13:15:08,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:15:08,271 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:15:08,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:15:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 13:15:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 13:15:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-14 13:15:08,347 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 109 [2024-10-14 13:15:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:15:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-14 13:15:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:15:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-14 13:15:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 13:15:08,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:08,353 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:08,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:15:08,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1514387362, now seen corresponding path program 1 times [2024-10-14 13:15:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:15:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953901957] [2024-10-14 13:15:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:15:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:15:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:15:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:15:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:15:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:15:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:15:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:15:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:15:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:15:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:15:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 13:15:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:15:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:15:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:15:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:15:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:15:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:15:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:15:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 129 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-10-14 13:15:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:15:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953901957] [2024-10-14 13:15:10,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953901957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:15:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989216289] [2024-10-14 13:15:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:10,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:15:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:15:10,397 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) [2024-10-14 13:15:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:15:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:10,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 13:15:10,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:15:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 118 proven. 129 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-14 13:15:11,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:15:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 138 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-10-14 13:15:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989216289] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:15:12,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:15:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2024-10-14 13:15:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639731946] [2024-10-14 13:15:12,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:15:12,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 13:15:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:15:12,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 13:15:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2024-10-14 13:15:12,389 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 27 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 11 states have call successors, (53), 4 states have call predecessors, (53), 9 states have return successors, (54), 9 states have call predecessors, (54), 11 states have call successors, (54) [2024-10-14 13:15:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:15:13,486 INFO L93 Difference]: Finished difference Result 164 states and 227 transitions. [2024-10-14 13:15:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:15:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 11 states have call successors, (53), 4 states have call predecessors, (53), 9 states have return successors, (54), 9 states have call predecessors, (54), 11 states have call successors, (54) Word has length 109 [2024-10-14 13:15:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:15:13,489 INFO L225 Difference]: With dead ends: 164 [2024-10-14 13:15:13,489 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 13:15:13,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=1555, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 13:15:13,492 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 144 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:15:13,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 261 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:15:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 13:15:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 58. [2024-10-14 13:15:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-10-14 13:15:13,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 109 [2024-10-14 13:15:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:15:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-10-14 13:15:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 24 states have internal predecessors, (76), 11 states have call successors, (53), 4 states have call predecessors, (53), 9 states have return successors, (54), 9 states have call predecessors, (54), 11 states have call successors, (54) [2024-10-14 13:15:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-10-14 13:15:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 13:15:13,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:13,520 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:13,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:15:13,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:15:13,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:13,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash -319216627, now seen corresponding path program 1 times [2024-10-14 13:15:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:15:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296568459] [2024-10-14 13:15:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:15:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:15:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:15:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:15:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:15:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:15:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:15:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:15:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:15:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:15:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:15:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 13:15:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:15:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:15:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:15:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:15:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:15:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:15:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:15:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-14 13:15:14,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:15:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296568459] [2024-10-14 13:15:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296568459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:15:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897776497] [2024-10-14 13:15:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:15:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:15:14,364 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) [2024-10-14 13:15:14,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:15:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:14,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 13:15:14,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:15:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 379 proven. 120 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-14 13:15:15,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:15:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 93 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-10-14 13:15:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897776497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:15:16,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:15:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 11] total 25 [2024-10-14 13:15:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407933003] [2024-10-14 13:15:16,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:15:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 13:15:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:15:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 13:15:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2024-10-14 13:15:16,504 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 10 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (49), 10 states have call predecessors, (49), 10 states have call successors, (49) [2024-10-14 13:15:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:15:17,330 INFO L93 Difference]: Finished difference Result 133 states and 168 transitions. [2024-10-14 13:15:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 13:15:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 10 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (49), 10 states have call predecessors, (49), 10 states have call successors, (49) Word has length 110 [2024-10-14 13:15:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:15:17,333 INFO L225 Difference]: With dead ends: 133 [2024-10-14 13:15:17,333 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 13:15:17,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=780, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 13:15:17,335 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 144 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:15:17,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 163 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:15:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 13:15:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-10-14 13:15:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-10-14 13:15:17,363 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 110 [2024-10-14 13:15:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:15:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-10-14 13:15:17,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 10 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (49), 10 states have call predecessors, (49), 10 states have call successors, (49) [2024-10-14 13:15:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-10-14 13:15:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 13:15:17,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:17,366 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:17,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:15:17,570 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 [2024-10-14 13:15:17,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:17,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 490129999, now seen corresponding path program 1 times [2024-10-14 13:15:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:15:17,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203221336] [2024-10-14 13:15:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:15:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:15:17,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:15:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:15:17,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:15:17,702 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:15:17,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:15:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:15:17,708 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 13:15:17,787 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:15:17,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:15:17 BoogieIcfgContainer [2024-10-14 13:15:17,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:15:17,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:15:17,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:15:17,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:15:17,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:15:07" (3/4) ... [2024-10-14 13:15:17,794 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:15:17,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:15:17,796 INFO L158 Benchmark]: Toolchain (without parser) took 11062.49ms. Allocated memory was 155.2MB in the beginning and 283.1MB in the end (delta: 127.9MB). Free memory was 109.1MB in the beginning and 123.3MB in the end (delta: -14.2MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-10-14 13:15:17,796 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:15:17,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.59ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 124.6MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 13:15:17,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.10ms. Allocated memory is still 155.2MB. Free memory was 124.6MB in the beginning and 122.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:15:17,797 INFO L158 Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 155.2MB. Free memory was 122.2MB in the beginning and 118.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:15:17,798 INFO L158 Benchmark]: RCFGBuilder took 466.06ms. Allocated memory is still 155.2MB. Free memory was 118.2MB in the beginning and 98.5MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 13:15:17,798 INFO L158 Benchmark]: TraceAbstraction took 10089.83ms. Allocated memory was 155.2MB in the beginning and 283.1MB in the end (delta: 127.9MB). Free memory was 97.9MB in the beginning and 123.3MB in the end (delta: -25.4MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-10-14 13:15:17,799 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 283.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:15:17,801 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.11ms. Allocated memory is still 155.2MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.59ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 124.6MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.10ms. Allocated memory is still 155.2MB. Free memory was 124.6MB in the beginning and 122.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.86ms. Allocated memory is still 155.2MB. Free memory was 122.2MB in the beginning and 118.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 466.06ms. Allocated memory is still 155.2MB. Free memory was 118.2MB in the beginning and 98.5MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10089.83ms. Allocated memory was 155.2MB in the beginning and 283.1MB in the end (delta: 127.9MB). Free memory was 97.9MB in the beginning and 123.3MB in the end (delta: -25.4MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 283.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] double var_1_9 = 256.5; [L30] double var_1_10 = 8.8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L86] var_1_13 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L87] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L93] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=65534, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=65534, var_1_13=-4611686007689969665, var_1_14=65534, var_1_15=0, var_1_16=1, var_1_1=131069, var_1_3=1073741823, var_1_4=1073741822, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 153 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=3, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 7228 SizeOfPredicates, 10 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3555/4284 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 13:15:17,837 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.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 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:15:20,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:15:20,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:15:20,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:15:20,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:15:20,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:15:20,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:15:20,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:15:20,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:15:20,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:15:20,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:15:20,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:15:20,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:15:20,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:15:20,154 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:15:20,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:15:20,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:15:20,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:15:20,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:15:20,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:15:20,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:15:20,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:15:20,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:15:20,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:15:20,161 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:15:20,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:15:20,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:15:20,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:15:20,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:15:20,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:15:20,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:15:20,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:15:20,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:15:20,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:15:20,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:15:20,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:15:20,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:15:20,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:15:20,166 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:15:20,167 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:15:20,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:15:20,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:15:20,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:15:20,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:15:20,168 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:15:20,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 84eeb297e823eb36482e14540b5864bb912f8862fcf27c075ed8bdc65c440193 [2024-10-14 13:15:20,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:15:20,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:15:20,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:15:20,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:15:20,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:15:20,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:22,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:15:22,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:15:22,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:22,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc882c6e/2c6776c6ebbf4cc1b119ba34d8a8cb68/FLAGf255a0700 [2024-10-14 13:15:22,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc882c6e/2c6776c6ebbf4cc1b119ba34d8a8cb68 [2024-10-14 13:15:22,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:15:22,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:15:22,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:15:22,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:15:22,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:15:22,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c418dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22, skipping insertion in model container [2024-10-14 13:15:22,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:15:22,494 WARN L248 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-53.i[913,926] [2024-10-14 13:15:22,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:15:22,569 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:15:22,589 WARN L248 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-53.i[913,926] [2024-10-14 13:15:22,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:15:22,641 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:15:22,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22 WrapperNode [2024-10-14 13:15:22,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:15:22,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:15:22,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:15:22,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:15:22,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,695 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-14 13:15:22,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:15:22,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:15:22,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:15:22,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:15:22,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,729 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]. [2024-10-14 13:15:22,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:15:22,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:15:22,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:15:22,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:15:22,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (1/1) ... [2024-10-14 13:15:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:15:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:15:22,798 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) [2024-10-14 13:15:22,800 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 [2024-10-14 13:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:15:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:15:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:15:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:15:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:15:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:15:22,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:15:22,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:15:23,359 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 13:15:23,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:15:23,419 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:15:23,419 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:15:23,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:15:23 BoogieIcfgContainer [2024-10-14 13:15:23,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:15:23,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:15:23,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:15:23,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:15:23,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:15:22" (1/3) ... [2024-10-14 13:15:23,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5937a25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:15:23, skipping insertion in model container [2024-10-14 13:15:23,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:15:22" (2/3) ... [2024-10-14 13:15:23,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5937a25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:15:23, skipping insertion in model container [2024-10-14 13:15:23,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:15:23" (3/3) ... [2024-10-14 13:15:23,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-53.i [2024-10-14 13:15:23,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:15:23,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:15:23,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:15:23,535 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;@40eb194a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:15:23,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:15:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 13:15:23,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:23,556 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:23,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1140265954, now seen corresponding path program 1 times [2024-10-14 13:15:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:15:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281677471] [2024-10-14 13:15:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:23,578 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 [2024-10-14 13:15:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:15:23,581 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) [2024-10-14 13:15:23,583 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 [2024-10-14 13:15:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:23,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:15:23,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:15:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-10-14 13:15:23,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:15:23,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:15:23,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281677471] [2024-10-14 13:15:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281677471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:15:23,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:15:23,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:15:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835413801] [2024-10-14 13:15:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:15:23,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:15:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:15:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:15:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:15:23,928 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:15:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:15:24,019 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2024-10-14 13:15:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:15:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2024-10-14 13:15:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:15:24,037 INFO L225 Difference]: With dead ends: 93 [2024-10-14 13:15:24,037 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 13:15:24,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:15:24,043 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:15:24,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:15:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 13:15:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 13:15:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:15:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-14 13:15:24,081 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 109 [2024-10-14 13:15:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:15:24,081 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-14 13:15:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:15:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-14 13:15:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 13:15:24,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:15:24,084 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:15:24,093 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 [2024-10-14 13:15:24,285 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 [2024-10-14 13:15:24,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:15:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:15:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1514387362, now seen corresponding path program 1 times [2024-10-14 13:15:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:15:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323318463] [2024-10-14 13:15:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:24,288 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 [2024-10-14 13:15:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:15:24,290 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) [2024-10-14 13:15:24,291 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 [2024-10-14 13:15:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:24,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 13:15:24,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:15:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 13:15:25,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:15:26,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:15:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323318463] [2024-10-14 13:15:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323318463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:15:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [945886363] [2024-10-14 13:15:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:15:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:15:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:15:26,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:15:26,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 13:15:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:15:26,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-14 13:15:26,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:15:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 13:15:28,957 INFO L311 TraceCheckSpWp]: Computing backward predicates...