/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-21 21:20:32,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:20:32,822 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-21 21:20:32,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:20:32,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:20:32,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:20:32,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:20:32,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:20:32,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:20:32,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:20:32,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:20:32,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:20:32,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:20:32,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:20:32,865 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:20:32,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:20:32,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:20:32,866 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:20:32,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:20:32,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:20:32,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:20:32,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:20:32,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:20:32,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:20:32,869 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:20:32,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:20:32,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:20:32,869 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:20:32,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:20:32,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:20:32,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:20:32,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:20:32,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:20:32,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:20:32,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:20:32,873 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:20:32,873 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-21 21:20:33,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:20:33,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:20:33,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:20:33,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:20:33,152 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:20:33,153 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-21 21:20:34,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:20:34,508 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:20:34,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2023-12-21 21:20:34,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4372e305a/022cac437a2d438b84d5c5e2980cb352/FLAG2fb971d14 [2023-12-21 21:20:34,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4372e305a/022cac437a2d438b84d5c5e2980cb352 [2023-12-21 21:20:34,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:20:34,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:20:34,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:20:34,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:20:34,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:20:34,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34, skipping insertion in model container [2023-12-21 21:20:34,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:20:34,714 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-21 21:20:34,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:20:34,747 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:20:34,761 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-21 21:20:34,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:20:34,791 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:20:34,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34 WrapperNode [2023-12-21 21:20:34,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:20:34,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:20:34,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:20:34,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:20:34,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,827 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-12-21 21:20:34,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:20:34,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:20:34,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:20:34,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:20:34,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,864 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-21 21:20:34,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:20:34,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:20:34,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:20:34,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:20:34,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (1/1) ... [2023-12-21 21:20:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:20:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:20:34,925 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-21 21:20:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:20:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:20:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 21:20:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:20:34,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:20:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 21:20:34,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 21:20:34,950 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-21 21:20:35,015 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:20:35,017 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:20:35,136 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:20:35,162 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:20:35,162 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 21:20:35,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:20:35 BoogieIcfgContainer [2023-12-21 21:20:35,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:20:35,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:20:35,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:20:35,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:20:35,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:20:34" (1/3) ... [2023-12-21 21:20:35,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38023721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:20:35, skipping insertion in model container [2023-12-21 21:20:35,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:20:34" (2/3) ... [2023-12-21 21:20:35,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38023721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:20:35, skipping insertion in model container [2023-12-21 21:20:35,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:20:35" (3/3) ... [2023-12-21 21:20:35,172 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2023-12-21 21:20:35,189 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:20:35,190 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:20:35,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:20:35,244 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;@147ab67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:20:35,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:20:35,248 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-21 21:20:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 21:20:35,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:20:35,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:20:35,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:20:35,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:20:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1702226251, now seen corresponding path program 1 times [2023-12-21 21:20:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:20:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791177761] [2023-12-21 21:20:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:20:35,274 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-21 21:20:35,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:20:35,280 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-21 21:20:35,331 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-21 21:20:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:20:35,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 21:20:35,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:20:35,468 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-21 21:20:35,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:20:35,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:20:35,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791177761] [2023-12-21 21:20:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791177761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:20:35,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:20:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:20:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374335820] [2023-12-21 21:20:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:20:35,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 21:20:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:20:35,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 21:20:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:20:35,511 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-21 21:20:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:20:35,578 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2023-12-21 21:20:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 21:20:35,580 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-21 21:20:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:20:35,584 INFO L225 Difference]: With dead ends: 40 [2023-12-21 21:20:35,584 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 21:20:35,587 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-21 21:20:35,590 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-21 21:20:35,590 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-21 21:20:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 21:20:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2023-12-21 21:20:35,619 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-21 21:20:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 21:20:35,622 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-21 21:20:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:20:35,622 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 21:20:35,623 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-21 21:20:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 21:20:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 21:20:35,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:20:35,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:20:35,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 21:20:35,828 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-21 21:20:35,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:20:35,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:20:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash -807775899, now seen corresponding path program 1 times [2023-12-21 21:20:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:20:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730233942] [2023-12-21 21:20:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:20:35,835 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-21 21:20:35,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:20:35,844 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-21 21:20:35,866 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-21 21:20:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:20:35,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 21:20:35,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:20:35,945 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-21 21:20:35,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:20:35,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:20:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730233942] [2023-12-21 21:20:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730233942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:20:35,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:20:35,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:20:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563925422] [2023-12-21 21:20:35,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:20:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 21:20:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:20:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 21:20:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:20:35,949 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-21 21:20:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:20:35,973 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2023-12-21 21:20:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 21:20:35,974 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-21 21:20:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:20:35,975 INFO L225 Difference]: With dead ends: 33 [2023-12-21 21:20:35,975 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 21:20:35,975 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-21 21:20:35,977 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-21 21:20:35,977 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-21 21:20:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 21:20:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 21:20:35,981 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-21 21:20:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-21 21:20:35,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-12-21 21:20:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:20:35,983 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-21 21:20:35,983 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-21 21:20:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-21 21:20:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 21:20:35,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:20:35,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:20:35,991 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-21 21:20:36,188 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-21 21:20:36,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:20:36,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:20:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2070034622, now seen corresponding path program 1 times [2023-12-21 21:20:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:20:36,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069525831] [2023-12-21 21:20:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:20:36,190 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-21 21:20:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:20:36,192 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-21 21:20:36,196 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-21 21:20:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:20:36,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 21:20:36,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:20:36,309 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-21 21:20:36,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:20:36,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:20:36,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069525831] [2023-12-21 21:20:36,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069525831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:20:36,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:20:36,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:20:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875842991] [2023-12-21 21:20:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:20:36,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 21:20:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:20:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 21:20:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:20:36,311 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-21 21:20:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:20:36,331 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-21 21:20:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 21:20:36,332 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-21 21:20:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:20:36,333 INFO L225 Difference]: With dead ends: 34 [2023-12-21 21:20:36,333 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 21:20:36,333 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-21 21:20:36,334 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-21 21:20:36,335 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-21 21:20:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 21:20:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 21:20:36,338 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-21 21:20:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 21:20:36,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-12-21 21:20:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:20:36,339 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 21:20:36,339 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-21 21:20:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 21:20:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 21:20:36,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:20:36,340 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:20:36,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-21 21:20:36,544 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-21 21:20:36,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:20:36,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:20:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 67039775, now seen corresponding path program 1 times [2023-12-21 21:20:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:20:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420247449] [2023-12-21 21:20:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:20:36,546 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-21 21:20:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:20:36,548 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-21 21:20:36,552 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-21 21:20:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:20:36,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 21:20:36,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:20:36,694 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-21 21:20:36,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:20:36,759 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-21 21:20:36,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:20:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420247449] [2023-12-21 21:20:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420247449] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:20:36,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:20:36,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 21:20:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757708958] [2023-12-21 21:20:36,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:20:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 21:20:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:20:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 21:20:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 21:20:36,768 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-21 21:20:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:20:36,816 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-12-21 21:20:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 21:20:36,817 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-21 21:20:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:20:36,817 INFO L225 Difference]: With dead ends: 38 [2023-12-21 21:20:36,818 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 21:20:36,818 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-21 21:20:36,819 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-21 21:20:36,819 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-21 21:20:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 21:20:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 21:20:36,823 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-21 21:20:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-21 21:20:36,824 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2023-12-21 21:20:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:20:36,824 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-21 21:20:36,824 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-21 21:20:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-21 21:20:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 21:20:36,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:20:36,825 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:20:36,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 21:20:37,030 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-21 21:20:37,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:20:37,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:20:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1923567129, now seen corresponding path program 2 times [2023-12-21 21:20:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:20:37,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936787043] [2023-12-21 21:20:37,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:20:37,032 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-21 21:20:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:20:37,037 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-21 21:20:37,038 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-21 21:20:37,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:20:37,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:20:37,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 21:20:37,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:20:37,335 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-21 21:20:37,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:20:41,333 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-21 21:20:41,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:20:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936787043] [2023-12-21 21:20:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936787043] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:20:41,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:20:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-21 21:20:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328166489] [2023-12-21 21:20:41,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:20:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 21:20:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:20:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 21:20:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-12-21 21:20:41,336 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-21 21:20:59,602 WARN L293 SmtUtils]: Spent 8.87s 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-21 21:21:16,258 WARN L293 SmtUtils]: Spent 13.62s 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-21 21:21:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:21:19,108 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2023-12-21 21:21:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 21:21:19,116 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-21 21:21:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:21:19,118 INFO L225 Difference]: With dead ends: 49 [2023-12-21 21:21:19,118 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 21:21:19,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-12-21 21:21:19,120 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:21:19,120 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.0s Time] [2023-12-21 21:21:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 21:21:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-12-21 21:21:19,128 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-21 21:21:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-12-21 21:21:19,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2023-12-21 21:21:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:21:19,129 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-12-21 21:21:19,130 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-21 21:21:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2023-12-21 21:21:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 21:21:19,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:21:19,131 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:21:19,144 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-21 21:21:19,334 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-21 21:21:19,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:21:19,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:21:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1366120522, now seen corresponding path program 3 times [2023-12-21 21:21:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:21:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276995457] [2023-12-21 21:21:19,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:21:19,336 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-21 21:21:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:21:19,338 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-21 21:21:19,339 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-21 21:21:19,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 21:21:19,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:21:19,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 21:21:19,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:21:19,410 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-21 21:21:19,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:21:19,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:21:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276995457] [2023-12-21 21:21:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276995457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:21:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:21:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 21:21:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501033185] [2023-12-21 21:21:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:21:19,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 21:21:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:21:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 21:21:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 21:21:19,412 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-21 21:21:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:21:19,447 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-12-21 21:21:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 21:21:19,447 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-21 21:21:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:21:19,449 INFO L225 Difference]: With dead ends: 56 [2023-12-21 21:21:19,449 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 21:21:19,449 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-21 21:21:19,451 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-21 21:21:19,452 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-21 21:21:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 21:21:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-12-21 21:21:19,460 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-21 21:21:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-21 21:21:19,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 21 [2023-12-21 21:21:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:21:19,461 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-21 21:21:19,462 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-21 21:21:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-21 21:21:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 21:21:19,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:21:19,463 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-21 21:21:19,470 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-21 21:21:19,667 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-21 21:21:19,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:21:19,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:21:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1993602136, now seen corresponding path program 1 times [2023-12-21 21:21:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:21:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699890239] [2023-12-21 21:21:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:21:19,668 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-21 21:21:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:21:19,669 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-21 21:21:19,672 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-21 21:21:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:21:19,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 21:21:19,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:21:19,956 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-21 21:21:19,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:21:20,171 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-21 21:21:20,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:21:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699890239] [2023-12-21 21:21:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699890239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:21:20,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:21:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-21 21:21:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58766428] [2023-12-21 21:21:20,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:21:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 21:21:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:21:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 21:21:20,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-21 21:21:20,174 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-21 21:21:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:21:20,754 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2023-12-21 21:21:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 21:21:20,757 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-21 21:21:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:21:20,757 INFO L225 Difference]: With dead ends: 89 [2023-12-21 21:21:20,757 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 21:21:20,758 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-21 21:21:20,759 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.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:21:20,759 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.3s Time] [2023-12-21 21:21:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 21:21:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-12-21 21:21:20,769 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-21 21:21:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2023-12-21 21:21:20,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 24 [2023-12-21 21:21:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:21:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2023-12-21 21:21:20,770 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-21 21:21:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2023-12-21 21:21:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 21:21:20,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:21:20,771 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-21 21:21:20,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 21:21:20,971 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-21 21:21:20,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:21:20,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:21:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1106828835, now seen corresponding path program 2 times [2023-12-21 21:21:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:21:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667045332] [2023-12-21 21:21:20,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:21:20,973 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-21 21:21:20,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:21:20,979 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-21 21:21:20,980 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-21 21:21:21,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:21:21,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:21:21,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 21:21:21,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:21:21,498 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-21 21:21:21,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:21:25,858 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-21 21:21:25,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:21:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667045332] [2023-12-21 21:21:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667045332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:21:25,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:21:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-21 21:21:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031026737] [2023-12-21 21:21:25,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:21:25,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 21:21:25,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:21:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 21:21:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-21 21:21:25,860 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-21 21:21:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:21:31,995 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2023-12-21 21:21:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 21:21:31,996 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-21 21:21:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:21:31,997 INFO L225 Difference]: With dead ends: 62 [2023-12-21 21:21:31,997 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 21:21:31,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-12-21 21:21:31,999 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:21:31,999 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.0s Time] [2023-12-21 21:21:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 21:21:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2023-12-21 21:21:32,010 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-21 21:21:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-21 21:21:32,011 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 26 [2023-12-21 21:21:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:21:32,011 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-21 21:21:32,011 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-21 21:21:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-21 21:21:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 21:21:32,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:21:32,012 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:21:32,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 21:21:32,216 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-21 21:21:32,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:21:32,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:21:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1183910484, now seen corresponding path program 4 times [2023-12-21 21:21:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:21:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768541268] [2023-12-21 21:21:32,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:21:32,217 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-21 21:21:32,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:21:32,218 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-21 21:21:32,220 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-21 21:21:32,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:21:32,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:21:32,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 21:21:32,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:21:32,426 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-21 21:21:32,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:21:32,715 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-21 21:21:32,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:21:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768541268] [2023-12-21 21:21:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768541268] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:21:32,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:21:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 21:21:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586944920] [2023-12-21 21:21:32,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:21:32,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 21:21:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:21:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 21:21:32,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-21 21:21:32,719 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-21 21:21:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:21:32,899 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-12-21 21:21:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 21:21:32,900 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-21 21:21:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:21:32,900 INFO L225 Difference]: With dead ends: 47 [2023-12-21 21:21:32,900 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 21:21:32,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-21 21:21:32,901 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 21:21:32,902 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-21 21:21:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 21:21:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 21:21:32,902 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-21 21:21:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 21:21:32,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2023-12-21 21:21:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:21:32,902 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 21:21:32,903 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-21 21:21:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 21:21:32,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 21:21:32,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 21:21:32,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 21:21:33,105 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-21 21:21:33,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 21:21:33,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 21:21:33,244 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 35) no Hoare annotation was computed. [2023-12-21 21:21:33,244 INFO L899 garLoopResultBuilder]: For program point L23-1(lines 21 37) no Hoare annotation was computed. [2023-12-21 21:21:33,244 INFO L899 garLoopResultBuilder]: For program point gcd_test_returnLabel#1(lines 20 37) no Hoare annotation was computed. [2023-12-21 21:21:33,244 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-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-12-21 21:21:33,245 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-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 21 37) no Hoare annotation was computed. [2023-12-21 21:21:33,245 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-21 21:21:33,245 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-21 21:21:33,245 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-21 21:21:33,246 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-21 21:21:33,246 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2023-12-21 21:21:33,246 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2023-12-21 21:21:33,246 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 19) the Hoare annotation is: true [2023-12-21 21:21:33,246 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-12-21 21:21:33,248 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2023-12-21 21:21:33,250 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 21:21:33,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 09:21:33 BoogieIcfgContainer [2023-12-21 21:21:33,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 21:21:33,259 INFO L158 Benchmark]: Toolchain (without parser) took 58722.03ms. Allocated memory is still 284.2MB. Free memory was 228.8MB in the beginning and 177.8MB in the end (delta: 51.0MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,259 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 194.0MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:21:33,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.75ms. Allocated memory is still 284.2MB. Free memory was 228.8MB in the beginning and 217.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.38ms. Allocated memory is still 284.2MB. Free memory was 217.4MB in the beginning and 215.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,260 INFO L158 Benchmark]: Boogie Preprocessor took 65.41ms. Allocated memory is still 284.2MB. Free memory was 215.9MB in the beginning and 213.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,260 INFO L158 Benchmark]: RCFGBuilder took 268.73ms. Allocated memory is still 284.2MB. Free memory was 213.8MB in the beginning and 200.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,261 INFO L158 Benchmark]: TraceAbstraction took 58094.61ms. Allocated memory is still 284.2MB. Free memory was 200.2MB in the beginning and 177.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-12-21 21:21:33,262 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.58ms. Allocated memory is still 194.0MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.75ms. Allocated memory is still 284.2MB. Free memory was 228.8MB in the beginning and 217.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.38ms. Allocated memory is still 284.2MB. Free memory was 217.4MB in the beginning and 215.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.41ms. Allocated memory is still 284.2MB. Free memory was 215.9MB in the beginning and 213.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.73ms. Allocated memory is still 284.2MB. Free memory was 213.8MB in the beginning and 200.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 58094.61ms. Allocated memory is still 284.2MB. Free memory was 200.2MB in the beginning and 177.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.9MB. 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: 58.0s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 4.9s 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, 46.7s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s 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-21 21:21:33,315 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...