/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:28:06,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:28:06,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 00:28:06,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:28:06,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:28:06,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:28:06,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:28:06,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:28:06,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:28:06,584 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:28:06,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:28:06,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:28:06,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:28:06,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:28:06,585 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:28:06,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:28:06,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:28:06,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:28:06,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:28:06,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:28:06,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:28:06,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:28:06,590 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:28:06,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:28:06,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:28:06,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:28:06,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:28:06,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:28:06,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:28:06,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:28:06,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:28:06,592 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:28:06,592 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 [2023-12-25 00:28:06,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:28:06,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:28:06,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:28:06,824 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:28:06,824 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:28:06,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2023-12-25 00:28:07,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:28:07,955 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:28:07,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2023-12-25 00:28:07,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb08f500b/e3a58287624b4949bf0912f42f9f9da5/FLAG152ef327e [2023-12-25 00:28:07,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb08f500b/e3a58287624b4949bf0912f42f9f9da5 [2023-12-25 00:28:07,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:28:07,975 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:28:07,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:28:07,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:28:07,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:28:07,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:28:07" (1/1) ... [2023-12-25 00:28:07,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f668cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:07, skipping insertion in model container [2023-12-25 00:28:07,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:28:07" (1/1) ... [2023-12-25 00:28:07,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:28:08,098 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c[573,586] [2023-12-25 00:28:08,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:28:08,115 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:28:08,124 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c[573,586] [2023-12-25 00:28:08,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:28:08,136 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:28:08,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08 WrapperNode [2023-12-25 00:28:08,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:28:08,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:28:08,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:28:08,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:28:08,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,158 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 00:28:08,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:28:08,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:28:08,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:28:08,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:28:08,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,175 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]. [2023-12-25 00:28:08,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:28:08,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:28:08,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:28:08,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:28:08,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (1/1) ... [2023-12-25 00:28:08,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:28:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:28:08,207 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) [2023-12-25 00:28:08,209 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 [2023-12-25 00:28:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:28:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:28:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:28:08,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:28:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:28:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:28:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:28:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:28:08,268 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:28:08,270 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:28:08,369 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:28:08,393 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:28:08,393 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:28:08,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:28:08 BoogieIcfgContainer [2023-12-25 00:28:08,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:28:08,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:28:08,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:28:08,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:28:08,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:28:07" (1/3) ... [2023-12-25 00:28:08,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b75632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:28:08, skipping insertion in model container [2023-12-25 00:28:08,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:28:08" (2/3) ... [2023-12-25 00:28:08,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b75632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:28:08, skipping insertion in model container [2023-12-25 00:28:08,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:28:08" (3/3) ... [2023-12-25 00:28:08,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2023-12-25 00:28:08,413 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:28:08,414 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:28:08,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:28:08,455 INFO L357 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, mHoare=true, 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;@383b5da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:28:08,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:28:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:28:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:28:08,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:08,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:08,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:08,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1586152774, now seen corresponding path program 1 times [2023-12-25 00:28:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840444529] [2023-12-25 00:28:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:08,478 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 [2023-12-25 00:28:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:08,480 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) [2023-12-25 00:28:08,481 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 [2023-12-25 00:28:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:08,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:28:08,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 00:28:08,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:28:08,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840444529] [2023-12-25 00:28:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840444529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:28:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:28:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:28:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809750037] [2023-12-25 00:28:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:28:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:28:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:28:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:28:08,597 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:28:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:08,616 INFO L93 Difference]: Finished difference Result 40 states and 57 transitions. [2023-12-25 00:28:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:28:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 00:28:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:08,627 INFO L225 Difference]: With dead ends: 40 [2023-12-25 00:28:08,627 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 00:28:08,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:28:08,631 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:08,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:28:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 00:28:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 00:28:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 00:28:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-25 00:28:08,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-25 00:28:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:08,656 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-25 00:28:08,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:28:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-25 00:28:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:28:08,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:08,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:08,659 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 [2023-12-25 00:28:08,857 WARN L477 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 [2023-12-25 00:28:08,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:08,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1915424194, now seen corresponding path program 1 times [2023-12-25 00:28:08,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:08,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680071388] [2023-12-25 00:28:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:08,860 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 [2023-12-25 00:28:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:08,861 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) [2023-12-25 00:28:08,892 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 [2023-12-25 00:28:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:08,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 00:28:08,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:28:09,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:28:09,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680071388] [2023-12-25 00:28:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680071388] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:28:09,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:28:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 00:28:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146850386] [2023-12-25 00:28:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:28:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:28:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:28:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:28:09,363 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:28:11,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-25 00:28:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:12,075 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-25 00:28:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:28:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 00:28:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:12,077 INFO L225 Difference]: With dead ends: 30 [2023-12-25 00:28:12,077 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 00:28:12,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:28:12,079 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:12,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 00:28:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 00:28:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-25 00:28:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:28:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-25 00:28:12,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2023-12-25 00:28:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:12,085 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-25 00:28:12,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:28:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-25 00:28:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:28:12,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:12,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:12,088 INFO L540 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)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:12,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:28:12,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:12,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash -934914682, now seen corresponding path program 1 times [2023-12-25 00:28:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922122935] [2023-12-25 00:28:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:12,291 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 [2023-12-25 00:28:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:12,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:28:12,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 00:28:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:12,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 00:28:12,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:28:12,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:12,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922122935] [2023-12-25 00:28:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922122935] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:28:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031113246] [2023-12-25 00:28:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:12,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:28:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:28:12,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:28:12,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-25 00:28:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:12,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:28:12,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:28:13,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:28:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1031113246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:28:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:28:13,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2023-12-25 00:28:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883093763] [2023-12-25 00:28:13,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:28:13,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 00:28:13,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 00:28:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 00:28:13,024 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:28:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:13,183 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-12-25 00:28:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:28:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 00:28:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:13,186 INFO L225 Difference]: With dead ends: 42 [2023-12-25 00:28:13,186 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 00:28:13,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:28:13,187 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:13,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 00:28:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 00:28:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-12-25 00:28:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 00:28:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-25 00:28:13,193 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 23 [2023-12-25 00:28:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:13,194 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-25 00:28:13,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:28:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-25 00:28:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 00:28:13,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:13,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:13,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 00:28:13,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-25 00:28:13,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 00:28:13,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:13,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash -115543711, now seen corresponding path program 1 times [2023-12-25 00:28:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975301762] [2023-12-25 00:28:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:13,602 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 [2023-12-25 00:28:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:13,603 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2023-12-25 00:28:13,605 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 (6)] Waiting until timeout for monitored process [2023-12-25 00:28:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:13,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 00:28:13,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:28:13,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:28:14,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975301762] [2023-12-25 00:28:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975301762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:28:14,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:28:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 00:28:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555345142] [2023-12-25 00:28:14,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:28:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 00:28:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 00:28:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-25 00:28:14,913 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 00:28:18,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:23,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:24,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:25,004 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2023-12-25 00:28:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 00:28:25,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-12-25 00:28:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:25,012 INFO L225 Difference]: With dead ends: 69 [2023-12-25 00:28:25,012 INFO L226 Difference]: Without dead ends: 58 [2023-12-25 00:28:25,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-25 00:28:25,013 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:25,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-12-25 00:28:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-25 00:28:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2023-12-25 00:28:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:28:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-12-25 00:28:25,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 25 [2023-12-25 00:28:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:25,029 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-12-25 00:28:25,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 00:28:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-12-25 00:28:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 00:28:25,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:25,032 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:25,035 INFO L540 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2023-12-25 00:28:25,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:25,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -221434263, now seen corresponding path program 1 times [2023-12-25 00:28:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:25,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631086912] [2023-12-25 00:28:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:25,237 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 [2023-12-25 00:28:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:25,238 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2023-12-25 00:28:25,239 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 (7)] Waiting until timeout for monitored process [2023-12-25 00:28:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:25,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 00:28:25,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:28:25,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 00:28:26,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631086912] [2023-12-25 00:28:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631086912] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:28:26,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:28:26,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 00:28:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249099813] [2023-12-25 00:28:26,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:28:26,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 00:28:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 00:28:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 00:28:26,697 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 00:28:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:28,883 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2023-12-25 00:28:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 00:28:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 31 [2023-12-25 00:28:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:28,889 INFO L225 Difference]: With dead ends: 70 [2023-12-25 00:28:28,889 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 00:28:28,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2023-12-25 00:28:28,890 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:28,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 105 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 00:28:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 00:28:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 00:28:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 00:28:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2023-12-25 00:28:28,900 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 [2023-12-25 00:28:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:28,901 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2023-12-25 00:28:28,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 00:28:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2023-12-25 00:28:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 00:28:28,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:28,902 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:28,911 INFO L540 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:29,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2023-12-25 00:28:29,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:29,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1280404424, now seen corresponding path program 1 times [2023-12-25 00:28:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191637310] [2023-12-25 00:28:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:29,110 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 [2023-12-25 00:28:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:29,111 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2023-12-25 00:28:29,112 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 (8)] Waiting until timeout for monitored process [2023-12-25 00:28:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:29,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 00:28:29,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 00:28:29,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 00:28:30,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191637310] [2023-12-25 00:28:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191637310] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:28:30,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:28:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 18 [2023-12-25 00:28:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343893662] [2023-12-25 00:28:30,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:28:30,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 00:28:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 00:28:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-12-25 00:28:30,219 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 00:28:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:31,397 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2023-12-25 00:28:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 00:28:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 39 [2023-12-25 00:28:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:31,400 INFO L225 Difference]: With dead ends: 77 [2023-12-25 00:28:31,400 INFO L226 Difference]: Without dead ends: 69 [2023-12-25 00:28:31,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-25 00:28:31,401 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:31,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 172 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 00:28:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-25 00:28:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2023-12-25 00:28:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 00:28:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-25 00:28:31,411 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 39 [2023-12-25 00:28:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:31,411 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-25 00:28:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 00:28:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-25 00:28:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 00:28:31,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:31,412 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:31,417 INFO L540 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:31,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 [2023-12-25 00:28:31,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:31,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash -486544411, now seen corresponding path program 1 times [2023-12-25 00:28:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503562299] [2023-12-25 00:28:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:28:31,618 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 [2023-12-25 00:28:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:31,619 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2023-12-25 00:28:31,620 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 (9)] Waiting until timeout for monitored process [2023-12-25 00:28:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:28:31,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 00:28:31,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 00:28:31,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 00:28:31,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503562299] [2023-12-25 00:28:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503562299] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:28:31,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:28:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 00:28:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548041302] [2023-12-25 00:28:31,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:28:31,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 00:28:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 00:28:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:28:31,754 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 00:28:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:31,897 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2023-12-25 00:28:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:28:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2023-12-25 00:28:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:31,898 INFO L225 Difference]: With dead ends: 104 [2023-12-25 00:28:31,898 INFO L226 Difference]: Without dead ends: 94 [2023-12-25 00:28:31,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:28:31,899 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:31,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 00:28:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-25 00:28:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-25 00:28:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 00:28:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2023-12-25 00:28:31,914 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 41 [2023-12-25 00:28:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:31,914 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2023-12-25 00:28:31,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 00:28:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2023-12-25 00:28:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 00:28:31,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:28:31,915 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:31,919 INFO L540 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:32,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2023-12-25 00:28:32,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:28:32,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:28:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1497661661, now seen corresponding path program 2 times [2023-12-25 00:28:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:28:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671651816] [2023-12-25 00:28:32,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:28:32,120 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 [2023-12-25 00:28:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:28:32,121 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-12-25 00:28:32,124 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 (10)] Waiting until timeout for monitored process [2023-12-25 00:28:32,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:28:32,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:28:32,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 00:28:32,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:28:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 00:28:32,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:28:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 00:28:35,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:28:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671651816] [2023-12-25 00:28:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671651816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:28:35,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:28:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2023-12-25 00:28:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582530830] [2023-12-25 00:28:35,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:28:35,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 00:28:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:28:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 00:28:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-12-25 00:28:35,632 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 00:28:37,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:42,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:46,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:47,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:28:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:28:47,276 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2023-12-25 00:28:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 00:28:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2023-12-25 00:28:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:28:47,280 INFO L225 Difference]: With dead ends: 98 [2023-12-25 00:28:47,280 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 00:28:47,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:28:47,281 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:28:47,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 113 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2023-12-25 00:28:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 00:28:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 00:28:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:28:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 00:28:47,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2023-12-25 00:28:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:28:47,282 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 00:28:47,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 00:28:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 00:28:47,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 00:28:47,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:28:47,292 INFO L540 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 00:28:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2023-12-25 00:28:47,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 00:28:52,227 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (and (or (= |ULTIMATE.start_main_~y3~0#1| (_ bv0 32)) (= (bvadd |ULTIMATE.start_main_~y3~0#1| |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1| (bvmul |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y1~0#1|)) |ULTIMATE.start_main_~x1~0#1|)) (bvsge |ULTIMATE.start_main_~x1~0#1| (_ bv0 32)) (= (bvadd |ULTIMATE.start_main_~y2~0#1| (bvmul |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~x2~0#1|)) |ULTIMATE.start_main_~x1~0#1|)) [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 47) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x1~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x1~0#1| (bvadd |ULTIMATE.start_main_~y3~0#1| |ULTIMATE.start_main_~y2~0#1| (bvmul |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~x2~0#1|)))) [2023-12-25 00:28:52,228 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x1~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x1~0#1| (bvadd |ULTIMATE.start_main_~y3~0#1| |ULTIMATE.start_main_~y2~0#1| (bvmul |ULTIMATE.start_main_~y1~0#1| |ULTIMATE.start_main_~x2~0#1|)))) [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 48) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2023-12-25 00:28:52,228 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (bvsge |ULTIMATE.start_main_~x1~0#1| (_ bv0 32)) [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2023-12-25 00:28:52,228 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 12 14) the Hoare annotation is: true [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2023-12-25 00:28:52,229 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 21) the Hoare annotation is: true [2023-12-25 00:28:52,229 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2023-12-25 00:28:52,231 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-25 00:28:52,232 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:28:52,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:28:52 BoogieIcfgContainer [2023-12-25 00:28:52,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:28:52,241 INFO L158 Benchmark]: Toolchain (without parser) took 44266.33ms. Allocated memory is still 293.6MB. Free memory was 242.5MB in the beginning and 199.8MB in the end (delta: 42.7MB). Peak memory consumption was 152.6MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,241 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 221.2MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:28:52,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.94ms. Allocated memory is still 293.6MB. Free memory was 242.2MB in the beginning and 231.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.21ms. Allocated memory is still 293.6MB. Free memory was 231.0MB in the beginning and 229.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,242 INFO L158 Benchmark]: Boogie Preprocessor took 23.66ms. Allocated memory is still 293.6MB. Free memory was 229.6MB in the beginning and 227.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,242 INFO L158 Benchmark]: RCFGBuilder took 210.95ms. Allocated memory is still 293.6MB. Free memory was 227.8MB in the beginning and 216.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,242 INFO L158 Benchmark]: TraceAbstraction took 43845.32ms. Allocated memory is still 293.6MB. Free memory was 215.5MB in the beginning and 199.8MB in the end (delta: 15.8MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. [2023-12-25 00:28:52,243 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.51ms. Allocated memory is still 221.2MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.94ms. Allocated memory is still 293.6MB. Free memory was 242.2MB in the beginning and 231.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.21ms. Allocated memory is still 293.6MB. Free memory was 231.0MB in the beginning and 229.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.66ms. Allocated memory is still 293.6MB. Free memory was 229.6MB in the beginning and 227.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 210.95ms. Allocated memory is still 293.6MB. Free memory was 227.8MB in the beginning and 216.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43845.32ms. Allocated memory is still 293.6MB. Free memory was 215.5MB in the beginning and 199.8MB in the end (delta: 15.8MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 769 SdHoareTripleChecker+Invalid, 23.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 128 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=7, InterpolantAutomatonStates: 84, 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, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 36 PreInvPairs, 77 NumberOfFragments, 54 HoareAnnotationTreeSize, 36 FormulaSimplifications, 2917 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FormulaSimplificationsInter, 726 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 436 ConstructedInterpolants, 2 QuantifiedInterpolants, 1644 SizeOfPredicates, 24 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 214/294 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((x1 >= 0) && (x1 == ((y3 + y2) % 4294967296))) RESULT: Ultimate proved your program to be correct! [2023-12-25 00:28:52,267 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...