/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/gcd_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:27:32,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:27:32,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:27:32,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:27:32,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:27:32,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:27:32,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:27:32,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:27:32,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:27:32,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:27:32,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:27:32,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:27:32,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:27:32,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:27:32,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:27:32,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:27:32,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:27:32,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:27:32,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:27:32,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:27:32,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:27:32,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:27:32,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:27:32,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:27:32,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:27:32,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:27:32,269 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:27:32,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:27:32,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:27:32,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:27:32,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:27:32,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:27:32,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:27:32,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:27:32,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:32,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:27:32,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:27:32,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:27:32,272 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:27:32,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:27:32,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:27:32,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:27:32,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:27:32,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:27:32,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:32,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:27:32,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:27:32,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:27:32,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:27:32,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:27:32,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_3.c [2024-11-05 20:27:34,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:27:34,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:27:34,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_3.c [2024-11-05 20:27:34,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed14f07f3/b668bfdd033f4043af8194bdebb5ff0b/FLAGa024ca4e7 [2024-11-05 20:27:34,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed14f07f3/b668bfdd033f4043af8194bdebb5ff0b [2024-11-05 20:27:34,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:27:34,601 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:27:34,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:34,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:27:34,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:27:34,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b750023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34, skipping insertion in model container [2024-11-05 20:27:34,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:27:34,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_3.c[664,677] [2024-11-05 20:27:34,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:34,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:27:34,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_3.c[664,677] [2024-11-05 20:27:34,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:34,861 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:27:34,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34 WrapperNode [2024-11-05 20:27:34,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:34,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:34,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:27:34,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:27:34,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,895 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-05 20:27:34,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:34,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:27:34,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:27:34,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:27:34,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,920 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]. [2024-11-05 20:27:34,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:27:34,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:27:34,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:27:34,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:27:34,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (1/1) ... [2024-11-05 20:27:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:27:34,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:27:34,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:27:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:27:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:27:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 20:27:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:27:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:27:35,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:27:35,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:27:35,292 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-05 20:27:35,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:27:35,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:27:35,303 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:27:35,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:35 BoogieIcfgContainer [2024-11-05 20:27:35,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:27:35,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:27:35,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:27:35,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:27:35,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:27:34" (1/3) ... [2024-11-05 20:27:35,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee1c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:35, skipping insertion in model container [2024-11-05 20:27:35,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:34" (2/3) ... [2024-11-05 20:27:35,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee1c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:35, skipping insertion in model container [2024-11-05 20:27:35,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:35" (3/3) ... [2024-11-05 20:27:35,318 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3.c [2024-11-05 20:27:35,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:27:35,339 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:27:35,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:27:35,416 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@202c076f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:27:35,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:27:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) [2024-11-05 20:27:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-05 20:27:35,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:35,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:35,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:35,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash 777289588, now seen corresponding path program 1 times [2024-11-05 20:27:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342393729] [2024-11-05 20:27:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:35,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 20:27:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:35,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:35,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:35,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:35,699 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342393729] [2024-11-05 20:27:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [342393729] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:35,699 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:35,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:27:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596952358] [2024-11-05 20:27:35,703 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:27:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:27:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:35,729 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-05 20:27:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:35,772 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-05 20:27:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:27:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 10 [2024-11-05 20:27:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:35,783 INFO L225 Difference]: With dead ends: 28 [2024-11-05 20:27:35,784 INFO L226 Difference]: Without dead ends: 12 [2024-11-05 20:27:35,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:35,793 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:35,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-05 20:27:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-05 20:27:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2024-11-05 20:27:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-05 20:27:35,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-05 20:27:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:35,827 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-05 20:27:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-05 20:27:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-05 20:27:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-05 20:27:35,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:35,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:35,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:36,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:36,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1742670346, now seen corresponding path program 1 times [2024-11-05 20:27:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444305267] [2024-11-05 20:27:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:36,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 [2024-11-05 20:27:36,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:36,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:36,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 20:27:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:27:36,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:36,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:36,145 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:36,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444305267] [2024-11-05 20:27:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1444305267] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:36,146 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257766032] [2024-11-05 20:27:36,146 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:36,149 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-05 20:27:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:36,201 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-05 20:27:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:27:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) Word has length 10 [2024-11-05 20:27:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:36,203 INFO L225 Difference]: With dead ends: 23 [2024-11-05 20:27:36,203 INFO L226 Difference]: Without dead ends: 14 [2024-11-05 20:27:36,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:36,205 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:36,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-05 20:27:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2024-11-05 20:27:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2024-11-05 20:27:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-05 20:27:36,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-11-05 20:27:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-05 20:27:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2024-11-05 20:27:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-05 20:27:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-05 20:27:36,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:36,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:27:36,416 WARN L453 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 [2024-11-05 20:27:36,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1742950324, now seen corresponding path program 1 times [2024-11-05 20:27:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43053243] [2024-11-05 20:27:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:36,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:36,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:36,422 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) [2024-11-05 20:27:36,423 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 [2024-11-05 20:27:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:36,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:27:36,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:36,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:36,735 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43053243] [2024-11-05 20:27:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [43053243] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:36,735 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2024-11-05 20:27:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779661810] [2024-11-05 20:27:36,736 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:36,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 20:27:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 20:27:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:36,742 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-11-05 20:27:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:36,848 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-05 20:27:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) Word has length 10 [2024-11-05 20:27:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:36,849 INFO L225 Difference]: With dead ends: 19 [2024-11-05 20:27:36,850 INFO L226 Difference]: Without dead ends: 13 [2024-11-05 20:27:36,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:36,851 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:36,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-05 20:27:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-05 20:27:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2024-11-05 20:27:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-05 20:27:36,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-11-05 20:27:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:36,855 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-05 20:27:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-11-05 20:27:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-11-05 20:27:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 20:27:36,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:36,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:36,862 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 [2024-11-05 20:27:37,058 WARN L453 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 [2024-11-05 20:27:37,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:37,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 607524954, now seen corresponding path program 1 times [2024-11-05 20:27:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985750676] [2024-11-05 20:27:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:37,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:37,063 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) [2024-11-05 20:27:37,064 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 [2024-11-05 20:27:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:37,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 20:27:37,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:39,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:42,098 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985750676] [2024-11-05 20:27:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1985750676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:42,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 20:27:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902573168] [2024-11-05 20:27:42,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:42,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 20:27:42,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 20:27:42,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:27:42,105 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) [2024-11-05 20:27:43,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 20:27:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:45,581 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-05 20:27:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:27:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) Word has length 11 [2024-11-05 20:27:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:45,582 INFO L225 Difference]: With dead ends: 25 [2024-11-05 20:27:45,582 INFO L226 Difference]: Without dead ends: 15 [2024-11-05 20:27:45,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:27:45,584 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:45,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-05 20:27:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-05 20:27:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-05 20:27:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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) [2024-11-05 20:27:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-05 20:27:45,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-05 20:27:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-05 20:27:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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) [2024-11-05 20:27:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-05 20:27:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 20:27:45,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:45,589 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:45,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:27:45,789 WARN L453 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 [2024-11-05 20:27:45,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 729899826, now seen corresponding path program 2 times [2024-11-05 20:27:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:45,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457963049] [2024-11-05 20:27:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:45,794 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) [2024-11-05 20:27:45,795 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 [2024-11-05 20:27:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:52,763 WARN L253 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-05 20:27:52,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:29:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:29:02,351 INFO L311 TraceCheckSpWp]: Computing backward predicates...