/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/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:38:37,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:38:37,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:38:37,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:38:37,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:38:37,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:38:37,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:38:37,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:38:37,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:38:37,996 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:38:37,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:38:37,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:38:37,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:38:37,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:38:37,997 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:38:37,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:38:37,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:38:37,998 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:38:37,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:38:37,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:38:37,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:38:37,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:38:37,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:38:37,999 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:38:38,000 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:38:38,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:38:38,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:38:38,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:38:38,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:38:38,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:38:38,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:38:38,002 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:38:38,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:38:38,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:38:38,003 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:38:38,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:38:38,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:38:38,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:38:38,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:38:38,187 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:38:38,187 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:38:38,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2023-12-16 16:38:39,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:38:39,492 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:38:39,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2023-12-16 16:38:39,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57174969e/91cb2ce3a50b43f691bf0646e9295ef0/FLAGdfa76e72a [2023-12-16 16:38:39,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57174969e/91cb2ce3a50b43f691bf0646e9295ef0 [2023-12-16 16:38:39,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:38:39,513 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:38:39,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:38:39,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:38:39,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:38:39,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170ef0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39, skipping insertion in model container [2023-12-16 16:38:39,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:38:39,665 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2023-12-16 16:38:39,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:38:39,680 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:38:39,690 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2023-12-16 16:38:39,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:38:39,700 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:38:39,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39 WrapperNode [2023-12-16 16:38:39,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:38:39,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:38:39,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:38:39,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:38:39,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,724 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2023-12-16 16:38:39,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:38:39,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:38:39,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:38:39,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:38:39,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,752 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:38:39,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:38:39,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:38:39,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:38:39,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:38:39,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (1/1) ... [2023-12-16 16:38:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:38:39,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:38:39,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:38:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:38:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:38:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:38:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:38:39,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:38:39,914 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:38:39,918 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:38:40,076 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:38:40,095 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:38:40,095 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 16:38:40,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:38:40 BoogieIcfgContainer [2023-12-16 16:38:40,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:38:40,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:38:40,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:38:40,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:38:40,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:38:39" (1/3) ... [2023-12-16 16:38:40,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fd6dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:38:40, skipping insertion in model container [2023-12-16 16:38:40,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:39" (2/3) ... [2023-12-16 16:38:40,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fd6dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:38:40, skipping insertion in model container [2023-12-16 16:38:40,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:38:40" (3/3) ... [2023-12-16 16:38:40,103 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_3.c [2023-12-16 16:38:40,117 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:38:40,117 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:38:40,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:38:40,170 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;@462bf0e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:38:40,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:38:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 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) [2023-12-16 16:38:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 16:38:40,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:40,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 16:38:40,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:40,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2570098, now seen corresponding path program 1 times [2023-12-16 16:38:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583184748] [2023-12-16 16:38:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:40,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:38:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:40,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:38:40,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:40,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:40,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:40,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583184748] [2023-12-16 16:38:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583184748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:40,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:38:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958048531] [2023-12-16 16:38:40,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:38:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:38:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:38:40,267 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:40,281 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2023-12-16 16:38:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:38:40,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-16 16:38:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:40,288 INFO L225 Difference]: With dead ends: 21 [2023-12-16 16:38:40,288 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 16:38:40,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:38:40,292 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:40,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 16:38:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-16 16:38:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-12-16 16:38:40,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2023-12-16 16:38:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:40,313 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-12-16 16:38:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-12-16 16:38:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 16:38:40,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:40,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 16:38:40,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:40,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:40,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:40,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2541268, now seen corresponding path program 1 times [2023-12-16 16:38:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134851468] [2023-12-16 16:38:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:40,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:40,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:38:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:40,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:40,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:40,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:40,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134851468] [2023-12-16 16:38:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134851468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:38:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241813782] [2023-12-16 16:38:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:40,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:40,615 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:40,658 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2023-12-16 16:38:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:40,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-16 16:38:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:40,660 INFO L225 Difference]: With dead ends: 17 [2023-12-16 16:38:40,660 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 16:38:40,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:40,661 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:40,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 16:38:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2023-12-16 16:38:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) [2023-12-16 16:38:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-16 16:38:40,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 4 [2023-12-16 16:38:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:40,664 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-16 16:38:40,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-16 16:38:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:38:40,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:40,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:40,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:40,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:40,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:40,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1569449088, now seen corresponding path program 1 times [2023-12-16 16:38:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533136936] [2023-12-16 16:38:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:40,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:40,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:38:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:40,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:40,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:40,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:40,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533136936] [2023-12-16 16:38:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533136936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:40,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573482128] [2023-12-16 16:38:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:40,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:40,905 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:40,927 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-12-16 16:38:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-12-16 16:38:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:40,928 INFO L225 Difference]: With dead ends: 21 [2023-12-16 16:38:40,928 INFO L226 Difference]: Without dead ends: 13 [2023-12-16 16:38:40,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:40,929 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:40,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-16 16:38:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2023-12-16 16:38:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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) [2023-12-16 16:38:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 16:38:40,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-16 16:38:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:40,932 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 16:38:40,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 16:38:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:38:40,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:40,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:40,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:41,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:41,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:41,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1644603312, now seen corresponding path program 1 times [2023-12-16 16:38:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:41,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053213070] [2023-12-16 16:38:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:41,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:41,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:41,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:38:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:41,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:41,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:41,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:41,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053213070] [2023-12-16 16:38:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053213070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453543401] [2023-12-16 16:38:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:41,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:41,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:41,186 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:41,209 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-12-16 16:38:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 [2023-12-16 16:38:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:41,210 INFO L225 Difference]: With dead ends: 21 [2023-12-16 16:38:41,210 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 16:38:41,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:41,211 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 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 [2023-12-16 16:38:41,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 16:38:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-16 16:38:41,214 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) [2023-12-16 16:38:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-16 16:38:41,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2023-12-16 16:38:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:41,214 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-16 16:38:41,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-16 16:38:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:38:41,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:41,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:41,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:41,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:41,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1367520426, now seen corresponding path program 1 times [2023-12-16 16:38:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:41,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120799918] [2023-12-16 16:38:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:41,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:41,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:38:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:41,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:41,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:41,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:41,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120799918] [2023-12-16 16:38:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120799918] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:41,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044952071] [2023-12-16 16:38:41,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:41,511 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2023-12-16 16:38:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:41,551 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-12-16 16:38:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:41,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Word has length 11 [2023-12-16 16:38:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:41,552 INFO L225 Difference]: With dead ends: 25 [2023-12-16 16:38:41,552 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 16:38:41,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:41,555 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:41,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 16:38:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-16 16:38:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2023-12-16 16:38:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-16 16:38:41,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-12-16 16:38:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:41,567 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-16 16:38:41,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2023-12-16 16:38:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-16 16:38:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 16:38:41,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:41,576 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:41,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:41,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 476406064, now seen corresponding path program 2 times [2023-12-16 16:38:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095162611] [2023-12-16 16:38:41,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:38:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:41,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:41,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:38:41,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:38:41,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:41,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:38:41,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:41,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:41,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095162611] [2023-12-16 16:38:41,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095162611] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:41,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:41,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:38:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229550748] [2023-12-16 16:38:41,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:38:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:38:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:41,912 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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) [2023-12-16 16:38:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:41,951 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-12-16 16:38:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:38:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 14 [2023-12-16 16:38:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:41,952 INFO L225 Difference]: With dead ends: 30 [2023-12-16 16:38:41,952 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 16:38:41,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:41,960 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:41,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 16:38:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 16:38:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-16 16:38:41,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2023-12-16 16:38:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:41,969 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-16 16:38:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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) [2023-12-16 16:38:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-16 16:38:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 16:38:41,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:41,970 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:41,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:42,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1905166864, now seen corresponding path program 3 times [2023-12-16 16:38:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351812256] [2023-12-16 16:38:42,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:38:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:42,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:42,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 16:38:42,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:42,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:42,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:38:42,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-16 16:38:42,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-16 16:38:42,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351812256] [2023-12-16 16:38:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351812256] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:42,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:38:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676976864] [2023-12-16 16:38:42,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:42,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:42,297 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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) [2023-12-16 16:38:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:42,336 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-12-16 16:38:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:42,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 16 [2023-12-16 16:38:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:42,345 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:38:42,345 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 16:38:42,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:42,346 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:42,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 16:38:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-16 16:38:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-12-16 16:38:42,354 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 16 [2023-12-16 16:38:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:42,355 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-12-16 16:38:42,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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) [2023-12-16 16:38:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-12-16 16:38:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 16:38:42,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:42,356 INFO L195 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:42,360 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-16 16:38:42,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:42,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2131572924, now seen corresponding path program 4 times [2023-12-16 16:38:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:42,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760058333] [2023-12-16 16:38:42,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:38:42,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:42,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:42,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:38:42,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:38:42,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:42,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:42,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 166 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-16 16:38:42,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 166 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-16 16:38:42,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760058333] [2023-12-16 16:38:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760058333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:42,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416582827] [2023-12-16 16:38:42,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:42,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:42,667 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:42,731 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2023-12-16 16:38:42,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:42,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 52 [2023-12-16 16:38:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:42,735 INFO L225 Difference]: With dead ends: 202 [2023-12-16 16:38:42,735 INFO L226 Difference]: Without dead ends: 161 [2023-12-16 16:38:42,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:42,737 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:42,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-16 16:38:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-12-16 16:38:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.13125) internal successors, (181), 160 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2023-12-16 16:38:42,775 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 52 [2023-12-16 16:38:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:42,775 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2023-12-16 16:38:42,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2023-12-16 16:38:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-16 16:38:42,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:42,781 INFO L195 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:42,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-16 16:38:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:42,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -478080044, now seen corresponding path program 5 times [2023-12-16 16:38:42,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:42,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45405928] [2023-12-16 16:38:42,985 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:38:42,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:42,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:42,986 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:42,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:38:43,047 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-12-16 16:38:43,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:43,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:38:43,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4134 proven. 310 refuted. 0 times theorem prover too weak. 2098 trivial. 0 not checked. [2023-12-16 16:38:43,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4134 proven. 310 refuted. 0 times theorem prover too weak. 2098 trivial. 0 not checked. [2023-12-16 16:38:43,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45405928] [2023-12-16 16:38:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45405928] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:43,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:38:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305461380] [2023-12-16 16:38:43,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:38:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:38:43,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:43,234 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:43,322 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2023-12-16 16:38:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:38:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 160 [2023-12-16 16:38:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:43,324 INFO L225 Difference]: With dead ends: 355 [2023-12-16 16:38:43,324 INFO L226 Difference]: Without dead ends: 233 [2023-12-16 16:38:43,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:43,325 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:43,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:38:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-16 16:38:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-12-16 16:38:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.125) internal successors, (261), 232 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 261 transitions. [2023-12-16 16:38:43,349 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 261 transitions. Word has length 160 [2023-12-16 16:38:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:43,350 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 261 transitions. [2023-12-16 16:38:43,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 261 transitions. [2023-12-16 16:38:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 16:38:43,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:43,351 INFO L195 NwaCegarLoop]: trace histogram [144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:43,356 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-16 16:38:43,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,554 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:43,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1011087828, now seen corresponding path program 6 times [2023-12-16 16:38:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702371583] [2023-12-16 16:38:43,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 16:38:43,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:43,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:43,574 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 (11)] Waiting until timeout for monitored process [2023-12-16 16:38:44,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2023-12-16 16:38:44,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:44,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:38:44,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-12-16 16:38:44,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-12-16 16:38:44,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702371583] [2023-12-16 16:38:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702371583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:44,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:38:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11346989] [2023-12-16 16:38:44,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:44,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:38:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:38:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:44,832 INFO L87 Difference]: Start difference. First operand 233 states and 261 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:44,930 INFO L93 Difference]: Finished difference Result 350 states and 393 transitions. [2023-12-16 16:38:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:38:44,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 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 232 [2023-12-16 16:38:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:44,934 INFO L225 Difference]: With dead ends: 350 [2023-12-16 16:38:44,935 INFO L226 Difference]: Without dead ends: 347 [2023-12-16 16:38:44,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:44,936 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:44,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:38:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-16 16:38:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2023-12-16 16:38:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.1242774566473988) internal successors, (389), 346 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 389 transitions. [2023-12-16 16:38:44,981 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 389 transitions. Word has length 232 [2023-12-16 16:38:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:44,982 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 389 transitions. [2023-12-16 16:38:44,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 389 transitions. [2023-12-16 16:38:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2023-12-16 16:38:44,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:44,986 INFO L195 NwaCegarLoop]: trace histogram [216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1] [2023-12-16 16:38:45,006 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:45,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1991736492, now seen corresponding path program 7 times [2023-12-16 16:38:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:45,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021354736] [2023-12-16 16:38:45,193 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 16:38:45,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:45,194 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:45,213 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 (12)] Waiting until timeout for monitored process [2023-12-16 16:38:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:47,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 16:38:47,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2023-12-16 16:38:48,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2023-12-16 16:38:48,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021354736] [2023-12-16 16:38:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021354736] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:48,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2023-12-16 16:38:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795239174] [2023-12-16 16:38:48,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:48,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 16:38:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 16:38:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:38:48,634 INFO L87 Difference]: Start difference. First operand 347 states and 389 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:49,001 INFO L93 Difference]: Finished difference Result 405 states and 455 transitions. [2023-12-16 16:38:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 16:38:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 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 346 [2023-12-16 16:38:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:49,002 INFO L225 Difference]: With dead ends: 405 [2023-12-16 16:38:49,002 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:38:49,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-12-16 16:38:49,004 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:49,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:38:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:38:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:38:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:38:49,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 346 [2023-12-16 16:38:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:49,005 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:38:49,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:38:49,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:38:49,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:38:49,059 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:49,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:49,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:38:51,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:38:51,927 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-16 16:38:51,931 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (.cse0 (bvslt |ULTIMATE.start_main_~b~0#1| (_ bv6 32))) (.cse1 (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))) (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) .cse0) (and (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse1) (and (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) .cse0) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv5 32)) .cse1 .cse2) (and .cse1 (= |ULTIMATE.start_main_~c~0#1| (_ bv3 32)) .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) .cse1 .cse2) (and (= (_ bv4 32) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) .cse0) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv2 32)) .cse1 .cse2) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv3 32)) .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1))) [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 27) no Hoare annotation was computed. [2023-12-16 16:38:51,932 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 27) the Hoare annotation is: (or (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv6 32))) (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point L21-4(lines 15 32) no Hoare annotation was computed. [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 30) no Hoare annotation was computed. [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2023-12-16 16:38:51,932 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 22 26) no Hoare annotation was computed. [2023-12-16 16:38:51,933 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))) (or (and (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse0) (= |ULTIMATE.start_main_~a~0#1| (_ bv3 32)) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse0) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv6 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv6 32)) .cse0) (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (= (_ bv4 32) |ULTIMATE.start_main_~a~0#1|) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv3 32)) .cse0) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse0))) [2023-12-16 16:38:51,936 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2023-12-16 16:38:51,937 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:38:51,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:38:51 BoogieIcfgContainer [2023-12-16 16:38:51,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:38:51,955 INFO L158 Benchmark]: Toolchain (without parser) took 12442.59ms. Allocated memory was 351.3MB in the beginning and 421.5MB in the end (delta: 70.3MB). Free memory was 301.9MB in the beginning and 198.2MB in the end (delta: 103.7MB). Peak memory consumption was 237.5MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,955 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:38:51,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.38ms. Allocated memory is still 351.3MB. Free memory was 301.4MB in the beginning and 289.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.92ms. Allocated memory is still 351.3MB. Free memory was 289.8MB in the beginning and 288.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,956 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 351.3MB. Free memory was 288.8MB in the beginning and 286.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,956 INFO L158 Benchmark]: RCFGBuilder took 335.92ms. Allocated memory is still 351.3MB. Free memory was 286.7MB in the beginning and 275.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,956 INFO L158 Benchmark]: TraceAbstraction took 11857.76ms. Allocated memory was 351.3MB in the beginning and 421.5MB in the end (delta: 70.3MB). Free memory was 274.6MB in the beginning and 198.2MB in the end (delta: 76.4MB). Peak memory consumption was 210.3MB. Max. memory is 8.0GB. [2023-12-16 16:38:51,957 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.12ms. Allocated memory is still 198.2MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.38ms. Allocated memory is still 351.3MB. Free memory was 301.4MB in the beginning and 289.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.92ms. Allocated memory is still 351.3MB. Free memory was 289.8MB in the beginning and 288.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 351.3MB. Free memory was 288.8MB in the beginning and 286.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.92ms. Allocated memory is still 351.3MB. Free memory was 286.7MB in the beginning and 275.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11857.76ms. Allocated memory was 351.3MB in the beginning and 421.5MB in the end (delta: 70.3MB). Free memory was 274.6MB in the beginning and 198.2MB in the end (delta: 76.4MB). Peak memory consumption was 210.3MB. 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: 29]: 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 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 11, TraceHistogramMax: 216, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 129 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1672 GetRequests, 1603 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=10, InterpolantAutomatonStates: 76, 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, 11 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 304 NumberOfFragments, 238 HoareAnnotationTreeSize, 3 FormulaSimplifications, 2140 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FormulaSimplificationsInter, 2275 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 856 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 5351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1268 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 29729/109721 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: 21]: Loop Invariant Derived loop invariant: (((((((a == 3) || (a == 0)) || (a == 1)) || (a == 2)) || (4 == a)) || (((a == 6) && (c == 6)) && (b == 6))) || (a == 5)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((a == 2) && (b < 6)) || ((4 == b) && (a == 5))) || ((4 == a) && (b < 6))) || ((a == 1) && (b < 6))) || ((b == 1) && (a == 5))) || (((c == 0) && (a == 5)) && (b == 5))) || (((c == 5) && (a == 5)) && (b == 5))) || (((a == 5) && (c == 3)) && (b == 5))) || (((c == 1) && (a == 5)) && (b == 5))) || (((4 == c) && (a == 5)) && (b == 5))) || ((a == 0) && (b < 6))) || (((c == 6) && (a == 5)) && (b == 5))) || (((c == 2) && (a == 5)) && (b == 5))) || ((a == 3) && (b < 6))) || ((b == 0) && (a == 5))) || ((b == 3) && (a == 5))) || ((b == 2) && (a == 5))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((4 == b) && (a == 5)) || (a == 3)) || ((b == 1) && (a == 5))) || (((c == 6) && (b == 6)) && (a == 5))) || (a == 0)) || (a == 1)) || ((a == 5) && (b == 5))) || (a == 2)) || (4 == a)) || ((b == 0) && (a == 5))) || ((b == 3) && (a == 5))) || ((b == 2) && (a == 5))) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:38:51,982 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...