/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-scaling/divbin2_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:47:34,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:47:34,711 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-16 16:47:34,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:47:34,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:47:34,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:47:34,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:47:34,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:47:34,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:47:34,730 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:47:34,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:47:34,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:47:34,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:47:34,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:47:34,732 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:47:34,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:47:34,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:47:34,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:47:34,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:47:34,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:47:34,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:47:34,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:47:34,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:47:34,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:47:34,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:47:34,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:47:34,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:47:34,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:47:34,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:47:34,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:47:34,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:47:34,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:47:34,748 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:47:34,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:47:34,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:47:34,748 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:47:34,748 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-16 16:47:34,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:47:34,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:47:34,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:47:34,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:47:34,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:47:34,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2023-12-16 16:47:36,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:47:36,209 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:47:36,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2023-12-16 16:47:36,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ace06440/a21865b543294096b0cca7c4cdc28cdd/FLAG77f40afd6 [2023-12-16 16:47:36,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ace06440/a21865b543294096b0cca7c4cdc28cdd [2023-12-16 16:47:36,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:47:36,231 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:47:36,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:47:36,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:47:36,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:47:36,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495233f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36, skipping insertion in model container [2023-12-16 16:47:36,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:47:36,365 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-scaling/divbin2_valuebound1.i[951,964] [2023-12-16 16:47:36,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:47:36,383 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:47:36,392 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-scaling/divbin2_valuebound1.i[951,964] [2023-12-16 16:47:36,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:47:36,403 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:47:36,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36 WrapperNode [2023-12-16 16:47:36,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:47:36,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:47:36,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:47:36,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:47:36,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,425 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-12-16 16:47:36,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:47:36,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:47:36,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:47:36,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:47:36,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,440 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-16 16:47:36,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:47:36,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:47:36,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:47:36,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:47:36,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (1/1) ... [2023-12-16 16:47:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:47:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:47:36,483 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-16 16:47:36,502 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-16 16:47:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:47:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:47:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:47:36,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:47:36,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:47:36,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:47:36,569 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:47:36,571 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:47:36,719 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:47:36,738 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:47:36,738 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:47:36,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:47:36 BoogieIcfgContainer [2023-12-16 16:47:36,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:47:36,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:47:36,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:47:36,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:47:36,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:47:36" (1/3) ... [2023-12-16 16:47:36,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7fef66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:47:36, skipping insertion in model container [2023-12-16 16:47:36,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:36" (2/3) ... [2023-12-16 16:47:36,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7fef66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:47:36, skipping insertion in model container [2023-12-16 16:47:36,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:47:36" (3/3) ... [2023-12-16 16:47:36,777 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound1.i [2023-12-16 16:47:36,791 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:47:36,791 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:47:36,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:47:36,842 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;@5e7e3137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:47:36,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:47:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:47:36,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:36,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:36,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:36,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 334653711, now seen corresponding path program 1 times [2023-12-16 16:47:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880972289] [2023-12-16 16:47:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:36,871 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-16 16:47:36,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:36,873 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-16 16:47:36,907 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-16 16:47:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:36,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:47:36,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:36,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:36,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880972289] [2023-12-16 16:47:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880972289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:47:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478470952] [2023-12-16 16:47:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:36,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:47:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:47:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:47:37,001 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:37,027 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2023-12-16 16:47:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:47:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:47:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:37,033 INFO L225 Difference]: With dead ends: 34 [2023-12-16 16:47:37,033 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 16:47:37,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-16 16:47:37,039 INFO L413 NwaCegarLoop]: 19 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, 19 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-16 16:47:37,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 16:47:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 16:47:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:47:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-16 16:47:37,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-12-16 16:47:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:37,063 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-16 16:47:37,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-16 16:47:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:47:37,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:37,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:37,070 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:47:37,267 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-16 16:47:37,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:37,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -401566674, now seen corresponding path program 1 times [2023-12-16 16:47:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:37,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444767463] [2023-12-16 16:47:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:37,270 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-16 16:47:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:37,271 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-16 16:47:37,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:47:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:37,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:47:37,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:37,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:37,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:37,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444767463] [2023-12-16 16:47:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444767463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:37,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:37,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:47:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508257081] [2023-12-16 16:47:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:47:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:37,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:47:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:47:37,610 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:37,768 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-16 16:47:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:47:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 16:47:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:37,771 INFO L225 Difference]: With dead ends: 28 [2023-12-16 16:47:37,771 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:47:37,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:47:37,772 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:37,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:47:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:47:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 16:47:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-16 16:47:37,778 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2023-12-16 16:47:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:37,778 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-16 16:47:37,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-16 16:47:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:47:37,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:37,779 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:37,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 16:47:37,979 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-16 16:47:37,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:37,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1504476233, now seen corresponding path program 1 times [2023-12-16 16:47:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207700816] [2023-12-16 16:47:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:37,981 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-16 16:47:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:37,984 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-16 16:47:37,989 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-16 16:47:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:38,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:47:38,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:38,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:38,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207700816] [2023-12-16 16:47:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207700816] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 16:47:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 16:47:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2023-12-16 16:47:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842445504] [2023-12-16 16:47:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:38,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:47:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:47:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:47:38,699 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:39,363 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-16 16:47:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:47:39,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:47:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:39,366 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:47:39,366 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 16:47:39,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:47:39,367 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:39,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 16:47:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 16:47:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2023-12-16 16:47:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-16 16:47:39,374 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2023-12-16 16:47:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:39,375 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-16 16:47:39,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:47:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-16 16:47:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:47:39,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:39,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:39,388 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-16 16:47:39,577 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 [2023-12-16 16:47:39,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:39,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1989427041, now seen corresponding path program 1 times [2023-12-16 16:47:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:39,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398854446] [2023-12-16 16:47:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:39,579 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-16 16:47:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:39,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:47:39,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:47:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:39,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:47:39,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:39,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:39,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398854446] [2023-12-16 16:47:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398854446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:47:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684778846] [2023-12-16 16:47:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:39,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:47:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:39,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:47:39,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:47:39,636 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:47:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:39,676 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-12-16 16:47:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:47:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-16 16:47:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:39,677 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:47:39,677 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:47:39,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:47:39,678 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:39,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:47:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-16 16:47:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-16 16:47:39,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2023-12-16 16:47:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:39,683 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-16 16:47:39,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 16:47:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-16 16:47:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:47:39,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:39,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:39,687 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:47:39,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-16 16:47:39,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:39,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -989864836, now seen corresponding path program 1 times [2023-12-16 16:47:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179285873] [2023-12-16 16:47:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:39,887 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-16 16:47:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:39,890 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-16 16:47:39,900 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-16 16:47:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:39,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 16:47:39,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:40,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:41,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179285873] [2023-12-16 16:47:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179285873] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:41,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-16 16:47:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979553480] [2023-12-16 16:47:41,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:47:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:47:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:47:41,431 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:42,064 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-12-16 16:47:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:47:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-16 16:47:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:42,067 INFO L225 Difference]: With dead ends: 59 [2023-12-16 16:47:42,067 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 16:47:42,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:47:42,068 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:42,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 77 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:47:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 16:47:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-12-16 16:47:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:47:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-12-16 16:47:42,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2023-12-16 16:47:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:42,075 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-12-16 16:47:42,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:47:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-12-16 16:47:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:47:42,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:42,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:42,079 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 (6)] Ended with exit code 0 [2023-12-16 16:47:42,276 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-16 16:47:42,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:42,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1620400559, now seen corresponding path program 2 times [2023-12-16 16:47:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456907551] [2023-12-16 16:47:42,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:47:42,278 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-16 16:47:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:42,280 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-16 16:47:42,281 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-16 16:47:42,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:47:42,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:47:42,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:47:42,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:47:42,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:47:42,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456907551] [2023-12-16 16:47:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456907551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:42,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2023-12-16 16:47:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544096282] [2023-12-16 16:47:42,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:42,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:47:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:47:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:47:42,476 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:47:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:42,536 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2023-12-16 16:47:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:47:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-16 16:47:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:42,537 INFO L225 Difference]: With dead ends: 33 [2023-12-16 16:47:42,537 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:47:42,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:47:42,538 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:42,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:47:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:47:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:47:42,539 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-16 16:47:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:47:42,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-12-16 16:47:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:42,539 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:47:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:47:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:47:42,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:47:42,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:47:42,566 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-16 16:47:42,745 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-16 16:47:42,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:47:44,217 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:47:44,217 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-16 16:47:44,218 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-16 16:47:44,218 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:47:44,218 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 47) the Hoare annotation is: (let ((.cse0 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) |ULTIMATE.start_main_~A~0#1|) (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) .cse0 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))) (and (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) .cse0))) [2023-12-16 16:47:44,218 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|))) (.cse2 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse1 .cse2))) [2023-12-16 16:47:44,218 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-16 16:47:44,218 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2023-12-16 16:47:44,218 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 38 47) the Hoare annotation is: (let ((.cse1 (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse2 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|) .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) |ULTIMATE.start_main_~A~0#1|) (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))))) [2023-12-16 16:47:44,219 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse2 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv1 32)))) (or (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|) .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) |ULTIMATE.start_main_~A~0#1|) (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv1 32)) .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))))) [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 24) the Hoare annotation is: true [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2023-12-16 16:47:44,219 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-16 16:47:44,221 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-16 16:47:44,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:47:44,230 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated [2023-12-16 16:47:44,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated [2023-12-16 16:47:44,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated [2023-12-16 16:47:44,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated [2023-12-16 16:47:44,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:47:44 BoogieIcfgContainer [2023-12-16 16:47:44,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:47:44,233 INFO L158 Benchmark]: Toolchain (without parser) took 8002.05ms. Allocated memory was 192.9MB in the beginning and 284.2MB in the end (delta: 91.2MB). Free memory was 135.7MB in the beginning and 188.6MB in the end (delta: -52.9MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,233 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:47:44,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.83ms. Allocated memory is still 192.9MB. Free memory was 135.4MB in the beginning and 124.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.53ms. Allocated memory is still 192.9MB. Free memory was 124.2MB in the beginning and 122.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,234 INFO L158 Benchmark]: Boogie Preprocessor took 22.30ms. Allocated memory is still 192.9MB. Free memory was 122.5MB in the beginning and 120.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,234 INFO L158 Benchmark]: RCFGBuilder took 290.49ms. Allocated memory is still 192.9MB. Free memory was 120.7MB in the beginning and 109.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,234 INFO L158 Benchmark]: TraceAbstraction took 7460.53ms. Allocated memory is still 284.2MB. Free memory was 253.9MB in the beginning and 188.6MB in the end (delta: 65.4MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2023-12-16 16:47:44,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.14ms. Allocated memory is still 192.9MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.83ms. Allocated memory is still 192.9MB. Free memory was 135.4MB in the beginning and 124.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.53ms. Allocated memory is still 192.9MB. Free memory was 124.2MB in the beginning and 122.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.30ms. Allocated memory is still 192.9MB. Free memory was 122.5MB in the beginning and 120.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 290.49ms. Allocated memory is still 192.9MB. Free memory was 120.7MB in the beginning and 109.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7460.53ms. Allocated memory is still 284.2MB. Free memory was 253.9MB in the beginning and 188.6MB in the end (delta: 65.4MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~b~0#1 : bv32 :: ~bvadd~32(~r~0, ~bvmul~32(~q~0, ULTIMATE.start_main_~b~0#1)) == ~A~0) could not be translated * 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: 21]: 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 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 78 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 20 PreInvPairs, 31 NumberOfFragments, 191 HoareAnnotationTreeSize, 20 FormulaSimplifications, 195 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FormulaSimplificationsInter, 102 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 148 ConstructedInterpolants, 6 QuantifiedInterpolants, 763 SizeOfPredicates, 13 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 36/56 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: 38]: Loop Invariant Derived loop invariant: ((((((B == 1) && (r >= 1)) && (b == 2)) && (A <= 1)) || ((b == B) && (A <= 1))) || ((((((B == 1) && (b == 1)) && (((r + 1) % 4294967296) == A)) && (A >= 1)) && (A <= 1)) && (q == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((B == 1) && (r >= 1)) && (b == 2)) && (A <= 1)) || (((B == 1) && (b == 1)) && (A <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:47:44,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...