/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/bitvector/gcd_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:20:01,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:20:01,520 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 07:20:01,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:20:01,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:20:01,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:20:01,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:20:01,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:20:01,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:20:01,551 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:20:01,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:20:01,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:20:01,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:20:01,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:20:01,553 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:20:01,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:20:01,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:20:01,553 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:20:01,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:20:01,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:20:01,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:20:01,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:20:01,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:20:01,555 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:20:01,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:20:01,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:20:01,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:20:01,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:20:01,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:20:01,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:20:01,558 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:20:01,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:20:01,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:20:01,558 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:20:01,558 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 07:20:01,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:20:01,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:20:01,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:20:01,768 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:20:01,770 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:20:01,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_4.c [2023-12-16 07:20:02,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:20:02,968 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:20:02,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2023-12-16 07:20:02,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394ff508f/7337e1e3916e471eaac5773733fec60e/FLAGe6f4cbd78 [2023-12-16 07:20:02,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394ff508f/7337e1e3916e471eaac5773733fec60e [2023-12-16 07:20:02,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:20:02,990 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:20:02,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:20:02,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:20:02,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:20:02,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:20:02" (1/1) ... [2023-12-16 07:20:02,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@954eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:02, skipping insertion in model container [2023-12-16 07:20:02,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:20:02" (1/1) ... [2023-12-16 07:20:03,014 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:20:03,129 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c[662,675] [2023-12-16 07:20:03,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:20:03,151 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:20:03,159 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c[662,675] [2023-12-16 07:20:03,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:20:03,178 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:20:03,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03 WrapperNode [2023-12-16 07:20:03,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:20:03,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:20:03,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:20:03,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:20:03,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,206 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-12-16 07:20:03,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:20:03,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:20:03,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:20:03,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:20:03,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,222 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 07:20:03,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:20:03,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:20:03,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:20:03,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:20:03,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (1/1) ... [2023-12-16 07:20:03,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:20:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:20:03,278 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 07:20:03,285 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 07:20:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:20:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:20:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 07:20:03,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:20:03,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:20:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 07:20:03,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 07:20:03,342 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:20:03,344 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:20:03,453 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:20:03,478 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:20:03,478 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 07:20:03,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:20:03 BoogieIcfgContainer [2023-12-16 07:20:03,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:20:03,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:20:03,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:20:03,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:20:03,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:20:02" (1/3) ... [2023-12-16 07:20:03,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362ae803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:20:03, skipping insertion in model container [2023-12-16 07:20:03,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:03" (2/3) ... [2023-12-16 07:20:03,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362ae803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:20:03, skipping insertion in model container [2023-12-16 07:20:03,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:20:03" (3/3) ... [2023-12-16 07:20:03,485 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2023-12-16 07:20:03,498 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:20:03,498 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:20:03,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:20:03,544 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;@799164a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:20:03,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:20:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 07:20:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 07:20:03,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:03,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:03,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:03,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1702226251, now seen corresponding path program 1 times [2023-12-16 07:20:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033829390] [2023-12-16 07:20:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:20:03,567 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 07:20:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:03,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:20:03,582 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 07:20:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:20:03,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:20:03,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:03,699 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 07:20:03,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:20:03,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033829390] [2023-12-16 07:20:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033829390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:20:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:20:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:20:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88049751] [2023-12-16 07:20:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:20:03,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:20:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:20:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:20:03,730 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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 07:20:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:03,789 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2023-12-16 07:20:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:20:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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 07:20:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:03,795 INFO L225 Difference]: With dead ends: 40 [2023-12-16 07:20:03,795 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 07:20:03,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 07:20:03,830 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:03,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:20:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 07:20:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2023-12-16 07:20:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 07:20:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-16 07:20:03,858 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-16 07:20:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:03,858 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-16 07:20:03,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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 07:20:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-16 07:20:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 07:20:03,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:03,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:03,863 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 07:20:04,062 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 07:20:04,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:04,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash -807775899, now seen corresponding path program 1 times [2023-12-16 07:20:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525763511] [2023-12-16 07:20:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:20:04,065 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 07:20:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:04,067 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 07:20:04,068 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 07:20:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:20:04,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:20:04,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:04,146 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 07:20:04,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:20:04,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:04,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525763511] [2023-12-16 07:20:04,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525763511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:20:04,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:20:04,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:20:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739709123] [2023-12-16 07:20:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:20:04,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:20:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:20:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:20:04,149 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 07:20:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:04,180 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2023-12-16 07:20:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:20:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2023-12-16 07:20:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:04,184 INFO L225 Difference]: With dead ends: 33 [2023-12-16 07:20:04,184 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 07:20:04,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 07:20:04,187 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:04,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:20:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 07:20:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 07:20:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 07:20:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-16 07:20:04,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-12-16 07:20:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:04,194 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-16 07:20:04,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 07:20:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-16 07:20:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 07:20:04,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:04,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:04,215 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-16 07:20:04,395 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 07:20:04,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:04,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2070034622, now seen corresponding path program 1 times [2023-12-16 07:20:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836548394] [2023-12-16 07:20:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:20:04,398 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 07:20:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:04,400 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 07:20:04,412 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 07:20:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:20:04,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 07:20:04,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:20:04,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:20:04,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:04,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836548394] [2023-12-16 07:20:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836548394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:20:04,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:20:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:20:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086116263] [2023-12-16 07:20:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:20:04,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:20:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:04,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:20:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:20:04,555 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 07:20:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:04,579 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-16 07:20:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:20:04,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13 [2023-12-16 07:20:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:04,582 INFO L225 Difference]: With dead ends: 34 [2023-12-16 07:20:04,582 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 07:20:04,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 07:20:04,583 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:04,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:20:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 07:20:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 07:20:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 07:20:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-16 07:20:04,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-12-16 07:20:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:04,587 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-16 07:20:04,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 07:20:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-16 07:20:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 07:20:04,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:04,587 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:04,591 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:20:04,794 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 07:20:04,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:04,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 67039775, now seen corresponding path program 1 times [2023-12-16 07:20:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499879452] [2023-12-16 07:20:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:20:04,796 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 07:20:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:04,804 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 07:20:04,806 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 07:20:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:20:04,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 07:20:04,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:20:04,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:20:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:20:04,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499879452] [2023-12-16 07:20:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499879452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:20:04,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:20:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 07:20:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609314796] [2023-12-16 07:20:04,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:20:04,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:20:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:20:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:20:04,996 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 07:20:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:05,042 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-12-16 07:20:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:20:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 15 [2023-12-16 07:20:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:05,043 INFO L225 Difference]: With dead ends: 38 [2023-12-16 07:20:05,043 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 07:20:05,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:20:05,045 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:05,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:20:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 07:20:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 07:20:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 07:20:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-16 07:20:05,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2023-12-16 07:20:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:05,052 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-16 07:20:05,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 07:20:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-16 07:20:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 07:20:05,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:05,052 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:05,060 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 (5)] Ended with exit code 0 [2023-12-16 07:20:05,260 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 07:20:05,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:05,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1923567129, now seen corresponding path program 2 times [2023-12-16 07:20:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259063957] [2023-12-16 07:20:05,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:20:05,262 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 07:20:05,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:05,263 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 07:20:05,268 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 07:20:05,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:20:05,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:20:05,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 07:20:05,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:20:05,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:20:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 07:20:09,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259063957] [2023-12-16 07:20:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259063957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:20:09,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:20:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-16 07:20:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166859140] [2023-12-16 07:20:09,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:20:09,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 07:20:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 07:20:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:20:09,481 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:20:26,545 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 07:20:45,298 WARN L293 SmtUtils]: Spent 14.99s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 07:20:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:48,138 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2023-12-16 07:20:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:20:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-16 07:20:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:48,149 INFO L225 Difference]: With dead ends: 49 [2023-12-16 07:20:48,149 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 07:20:48,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-12-16 07:20:48,150 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:48,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 96 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-16 07:20:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 07:20:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-12-16 07:20:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 38 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 07:20:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-12-16 07:20:48,157 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2023-12-16 07:20:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:48,158 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-12-16 07:20:48,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:20:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2023-12-16 07:20:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 07:20:48,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:48,159 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:48,165 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-16 07:20:48,360 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 07:20:48,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:48,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1366120522, now seen corresponding path program 3 times [2023-12-16 07:20:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500349861] [2023-12-16 07:20:48,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:20:48,361 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 07:20:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:48,362 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 07:20:48,388 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 07:20:48,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 07:20:48,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:20:48,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:20:48,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 07:20:48,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:20:48,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500349861] [2023-12-16 07:20:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500349861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:20:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:20:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:20:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383774603] [2023-12-16 07:20:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:20:48,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:20:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:20:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:20:48,436 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 07:20:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:48,465 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-12-16 07:20:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:20:48,467 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), 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 21 [2023-12-16 07:20:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:48,468 INFO L225 Difference]: With dead ends: 56 [2023-12-16 07:20:48,468 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 07:20:48,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 07:20:48,469 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:48,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:20:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 07:20:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-12-16 07:20:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 07:20:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-16 07:20:48,474 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 21 [2023-12-16 07:20:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:48,474 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-16 07:20:48,475 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), 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 07:20:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-16 07:20:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 07:20:48,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:48,475 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:48,483 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 07:20:48,683 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 07:20:48,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:48,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1993602136, now seen corresponding path program 1 times [2023-12-16 07:20:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225023782] [2023-12-16 07:20:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:20:48,685 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 07:20:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:48,686 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-16 07:20:48,686 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-16 07:20:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:20:48,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 07:20:48,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:20:48,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:20:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:20:49,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225023782] [2023-12-16 07:20:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225023782] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:20:49,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:20:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 07:20:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652118931] [2023-12-16 07:20:49,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:20:49,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 07:20:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:49,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 07:20:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 07:20:49,154 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 07:20:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:20:49,685 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2023-12-16 07:20:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:20:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-16 07:20:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:20:49,687 INFO L225 Difference]: With dead ends: 89 [2023-12-16 07:20:49,688 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 07:20:49,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2023-12-16 07:20:49,688 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:20:49,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 91 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:20:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 07:20:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-12-16 07:20:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 07:20:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2023-12-16 07:20:49,697 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 24 [2023-12-16 07:20:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:20:49,697 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2023-12-16 07:20:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 07:20:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2023-12-16 07:20:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 07:20:49,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:20:49,698 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:20:49,703 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 (8)] Ended with exit code 0 [2023-12-16 07:20:49,898 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-16 07:20:49,899 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:20:49,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:20:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1106828835, now seen corresponding path program 2 times [2023-12-16 07:20:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:20:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314047183] [2023-12-16 07:20:49,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:20:49,900 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 07:20:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:20:49,901 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-16 07:20:49,904 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-16 07:20:49,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:20:49,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:20:50,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 07:20:50,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:20:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 07:20:50,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:20:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 07:20:54,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:20:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314047183] [2023-12-16 07:20:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314047183] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:20:54,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:20:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-16 07:20:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145856140] [2023-12-16 07:20:54,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:20:54,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 07:20:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:20:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 07:20:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:20:54,829 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 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 07:21:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:21:02,564 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2023-12-16 07:21:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 07:21:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 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 26 [2023-12-16 07:21:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:21:02,565 INFO L225 Difference]: With dead ends: 62 [2023-12-16 07:21:02,565 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 07:21:02,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-12-16 07:21:02,566 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:21:02,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 07:21:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 07:21:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2023-12-16 07:21:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 07:21:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-16 07:21:02,572 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 26 [2023-12-16 07:21:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:21:02,572 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-16 07:21:02,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 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 07:21:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-16 07:21:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 07:21:02,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:21:02,573 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:21:02,580 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 (9)] Ended with exit code 0 [2023-12-16 07:21:02,783 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-16 07:21:02,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:21:02,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:21:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1183910484, now seen corresponding path program 4 times [2023-12-16 07:21:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:21:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592138828] [2023-12-16 07:21:02,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:21:02,785 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 07:21:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:21:02,786 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-16 07:21:02,797 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-16 07:21:02,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:21:02,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:21:02,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 07:21:02,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:21:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:21:03,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:21:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 07:21:03,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:21:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592138828] [2023-12-16 07:21:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592138828] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:21:03,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:21:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 07:21:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674287868] [2023-12-16 07:21:03,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:21:03,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 07:21:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:21:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 07:21:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-16 07:21:03,421 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 07:21:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:21:03,593 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-12-16 07:21:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 07:21:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 25 [2023-12-16 07:21:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:21:03,594 INFO L225 Difference]: With dead ends: 47 [2023-12-16 07:21:03,594 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 07:21:03,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-16 07:21:03,595 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:21:03,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:21:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 07:21:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 07:21:03,595 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 07:21:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 07:21:03,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2023-12-16 07:21:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:21:03,596 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 07:21:03,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 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 07:21:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 07:21:03,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 07:21:03,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:21:03,613 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 (10)] Ended with exit code 0 [2023-12-16 07:21:03,802 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-16 07:21:03,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 07:21:03,964 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 07:21:03,964 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 35) no Hoare annotation was computed. [2023-12-16 07:21:03,964 INFO L899 garLoopResultBuilder]: For program point L23-1(lines 21 37) no Hoare annotation was computed. [2023-12-16 07:21:03,964 INFO L899 garLoopResultBuilder]: For program point gcd_test_returnLabel#1(lines 20 37) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1| (_ bv63 32)) (= |ULTIMATE.start_main_~g~0#1| (_ bv9 32)) (= |ULTIMATE.start_gcd_test_#res#1| (_ bv9 32))) [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 29 35) the Hoare annotation is: (let ((.cse0 (= (_ bv18 32) |ULTIMATE.start_main_~y~0#1|)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv63 32))) (.cse2 (= (_ bv18 32) |ULTIMATE.start_gcd_test_~b#1|)) (.cse3 (= |ULTIMATE.start_gcd_test_~a#1| (_ bv9 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv63 32) |ULTIMATE.start_gcd_test_~a#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_gcd_test_~b#1| (_ bv0 32)) .cse3) (and .cse0 (= |ULTIMATE.start_gcd_test_~a#1| (_ bv45 32)) .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_gcd_test_~b#1| (_ bv9 32)) .cse3) (and .cse0 (= (_ bv27 32) |ULTIMATE.start_gcd_test_~a#1|) .cse1 .cse2) (and .cse0 .cse1 .cse2 .cse3))) [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 21 37) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= (_ bv18 32) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (_ bv63 32)) (= |ULTIMATE.start_main_~g~0#1| (_ bv9 32)) (= |ULTIMATE.start_gcd_test_#res#1| (_ bv9 32))) [2023-12-16 07:21:03,965 INFO L895 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: (and (= (_ bv18 32) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (_ bv63 32)) (= |ULTIMATE.start_main_~g~0#1| (_ bv9 32)) (= |ULTIMATE.start_gcd_test_#res#1| (_ bv9 32))) [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2023-12-16 07:21:03,965 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 19) the Hoare annotation is: true [2023-12-16 07:21:03,966 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-12-16 07:21:03,968 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2023-12-16 07:21:03,969 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:21:03,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:21:03 BoogieIcfgContainer [2023-12-16 07:21:03,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:21:03,976 INFO L158 Benchmark]: Toolchain (without parser) took 60986.43ms. Allocated memory is still 312.5MB. Free memory was 259.0MB in the beginning and 128.0MB in the end (delta: 131.0MB). Peak memory consumption was 130.9MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,977 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 206.6MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:21:03,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.76ms. Allocated memory is still 312.5MB. Free memory was 259.0MB in the beginning and 247.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.89ms. Allocated memory is still 312.5MB. Free memory was 247.5MB in the beginning and 245.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,977 INFO L158 Benchmark]: Boogie Preprocessor took 27.61ms. Allocated memory is still 312.5MB. Free memory was 245.8MB in the beginning and 244.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,977 INFO L158 Benchmark]: RCFGBuilder took 243.28ms. Allocated memory is still 312.5MB. Free memory was 244.3MB in the beginning and 231.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,978 INFO L158 Benchmark]: TraceAbstraction took 60496.33ms. Allocated memory is still 312.5MB. Free memory was 231.2MB in the beginning and 128.0MB in the end (delta: 103.2MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2023-12-16 07:21:03,978 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 206.6MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.76ms. Allocated memory is still 312.5MB. Free memory was 259.0MB in the beginning and 247.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.89ms. Allocated memory is still 312.5MB. Free memory was 247.5MB in the beginning and 245.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.61ms. Allocated memory is still 312.5MB. Free memory was 245.8MB in the beginning and 244.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.28ms. Allocated memory is still 312.5MB. Free memory was 244.3MB in the beginning and 231.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 60496.33ms. Allocated memory is still 312.5MB. Free memory was 231.2MB in the beginning and 128.0MB in the end (delta: 103.2MB). Peak memory consumption was 102.6MB. 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: 16]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 47.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 739 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 105 mSDtfsCounter, 739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 48.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, InterpolantAutomatonStates: 72, 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, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 31 PreInvPairs, 40 NumberOfFragments, 116 HoareAnnotationTreeSize, 31 FormulaSimplifications, 81 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 1245 SizeOfPredicates, 36 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 96/254 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: 29]: Loop Invariant Derived loop invariant: (((((((18 == b) && (63 == a)) || ((b == 0) && (a == 9))) || ((a == 45) && (18 == b))) || ((b == 9) && (a == 9))) || ((27 == a) && (18 == b))) || ((18 == b) && (a == 9))) RESULT: Ultimate proved your program to be correct! [2023-12-16 07:21:04,016 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...