/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/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:10:01,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:10:01,145 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-24 22:10:01,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:10:01,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:10:01,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:10:01,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:10:01,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:10:01,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:10:01,172 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:10:01,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:10:01,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:10:01,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:10:01,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:10:01,174 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:10:01,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:10:01,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:10:01,175 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:10:01,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:10:01,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:10:01,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:10:01,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:10:01,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:10:01,177 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:10:01,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:10:01,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:10:01,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:10:01,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:10:01,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:10:01,179 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:10:01,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:10:01,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:10:01,180 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:10:01,180 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-24 22:10:01,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:10:01,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:10:01,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:10:01,397 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:10:01,399 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:10:01,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2023-12-24 22:10:02,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:10:02,659 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:10:02,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2023-12-24 22:10:02,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a942b0d17/212ebe7bb3904f0ba7528572b73603dc/FLAGced93647e [2023-12-24 22:10:02,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a942b0d17/212ebe7bb3904f0ba7528572b73603dc [2023-12-24 22:10:02,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:10:02,681 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:10:02,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:10:02,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:10:02,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:10:02,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16090b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02, skipping insertion in model container [2023-12-24 22:10:02,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:10:02,808 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2023-12-24 22:10:02,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:10:02,823 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:10:02,831 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2023-12-24 22:10:02,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:10:02,842 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:10:02,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02 WrapperNode [2023-12-24 22:10:02,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:10:02,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:10:02,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:10:02,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:10:02,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,869 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2023-12-24 22:10:02,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:10:02,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:10:02,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:10:02,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:10:02,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,886 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-24 22:10:02,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:10:02,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:10:02,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:10:02,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:10:02,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (1/1) ... [2023-12-24 22:10:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:10:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:10:02,926 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-24 22:10:02,929 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-24 22:10:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:10:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:10:02,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:10:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:10:03,007 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:10:03,010 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:10:03,168 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:10:03,188 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:10:03,189 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 22:10:03,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:10:03 BoogieIcfgContainer [2023-12-24 22:10:03,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:10:03,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:10:03,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:10:03,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:10:03,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:10:02" (1/3) ... [2023-12-24 22:10:03,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f538ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:10:03, skipping insertion in model container [2023-12-24 22:10:03,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:10:02" (2/3) ... [2023-12-24 22:10:03,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f538ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:10:03, skipping insertion in model container [2023-12-24 22:10:03,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:10:03" (3/3) ... [2023-12-24 22:10:03,194 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2023-12-24 22:10:03,206 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:10:03,206 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:10:03,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:10:03,251 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;@7c20c81a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:10:03,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:10:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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-24 22:10:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 22:10:03,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:03,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 22:10:03,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:03,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1900177325, now seen corresponding path program 1 times [2023-12-24 22:10:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:03,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296841395] [2023-12-24 22:10:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:10:03,273 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-24 22:10:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:03,275 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-24 22:10:03,295 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-24 22:10:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:10:03,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:10:03,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:10:03,391 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-24 22:10:03,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:10:03,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:10:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296841395] [2023-12-24 22:10:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296841395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:10:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:10:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:10:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214228958] [2023-12-24 22:10:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:10:03,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:10:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:10:03,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:10:03,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:10:03,421 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-24 22:10:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:03,453 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2023-12-24 22:10:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:10:03,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-24 22:10:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:03,459 INFO L225 Difference]: With dead ends: 20 [2023-12-24 22:10:03,460 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 22:10:03,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-24 22:10:03,464 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 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-24 22:10:03,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:10:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 22:10:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-12-24 22:10:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-24 22:10:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-24 22:10:03,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-12-24 22:10:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:03,483 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-24 22:10:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-24 22:10:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-24 22:10:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 22:10:03,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:03,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 22:10:03,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 22:10:03,687 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-24 22:10:03,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:03,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1900117743, now seen corresponding path program 1 times [2023-12-24 22:10:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231204772] [2023-12-24 22:10:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:10:03,700 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-24 22:10:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:03,702 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-24 22:10:03,702 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-24 22:10:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:10:03,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:10:03,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:10:03,808 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-24 22:10:03,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:10:03,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:10:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231204772] [2023-12-24 22:10:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231204772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:10:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:10:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:10:03,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521416265] [2023-12-24 22:10:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:10:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 22:10:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:10:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 22:10:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:10:03,811 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-24 22:10:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:03,830 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-12-24 22:10:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 22:10:03,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-12-24 22:10:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:03,831 INFO L225 Difference]: With dead ends: 15 [2023-12-24 22:10:03,831 INFO L226 Difference]: Without dead ends: 13 [2023-12-24 22:10:03,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:10:03,832 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:10:03,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:10:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-24 22:10:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-12-24 22:10:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:10:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-12-24 22:10:03,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2023-12-24 22:10:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:03,835 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-12-24 22:10:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-24 22:10:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-12-24 22:10:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 22:10:03,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:03,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:10:03,841 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-24 22:10:04,039 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-24 22:10:04,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:04,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash -583907041, now seen corresponding path program 1 times [2023-12-24 22:10:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709842357] [2023-12-24 22:10:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:10:04,042 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-24 22:10:04,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:04,043 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-24 22:10:04,046 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-24 22:10:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:10:04,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:10:04,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:10:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:04,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:10:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:04,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:10:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709842357] [2023-12-24 22:10:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709842357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:10:04,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:10:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 22:10:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505051841] [2023-12-24 22:10:04,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:10:04,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:10:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:10:04,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:10:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:10:04,164 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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-24 22:10:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:04,192 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-12-24 22:10:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:10:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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) Word has length 11 [2023-12-24 22:10:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:04,193 INFO L225 Difference]: With dead ends: 37 [2023-12-24 22:10:04,193 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 22:10:04,194 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-24 22:10:04,194 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:10:04,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:10:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 22:10:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-12-24 22:10:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-24 22:10:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-24 22:10:04,198 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2023-12-24 22:10:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:04,199 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-24 22:10:04,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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-24 22:10:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-24 22:10:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 22:10:04,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:04,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-12-24 22:10:04,206 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-24 22:10:04,401 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-24 22:10:04,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:04,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:04,407 INFO L85 PathProgramCache]: Analyzing trace with hash -583966623, now seen corresponding path program 1 times [2023-12-24 22:10:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878681122] [2023-12-24 22:10:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:10:04,410 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-24 22:10:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:04,418 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-24 22:10:04,419 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-24 22:10:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:10:04,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 22:10:04,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:10:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:04,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:10:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:04,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:10:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878681122] [2023-12-24 22:10:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878681122] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:10:04,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:10:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:10:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101182957] [2023-12-24 22:10:04,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:10:04,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:10:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:10:04,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:10:04,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:10:04,761 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:10:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:04,872 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-12-24 22:10:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 22:10:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-24 22:10:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:04,873 INFO L225 Difference]: With dead ends: 33 [2023-12-24 22:10:04,873 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 22:10:04,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:10:04,874 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:10:04,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:10:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 22:10:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-24 22:10:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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-24 22:10:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-12-24 22:10:04,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 11 [2023-12-24 22:10:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:04,878 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-12-24 22:10:04,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:10:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-12-24 22:10:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 22:10:04,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:04,879 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2023-12-24 22:10:04,883 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-24 22:10:05,081 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-24 22:10:05,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:05,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash 517506605, now seen corresponding path program 2 times [2023-12-24 22:10:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344836669] [2023-12-24 22:10:05,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:10:05,083 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-24 22:10:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:05,086 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-24 22:10:05,087 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-24 22:10:05,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:10:05,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:10:05,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:10:05,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:10:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:05,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:10:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:10:05,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:10:05,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344836669] [2023-12-24 22:10:05,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344836669] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:10:05,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:10:05,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:10:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050928965] [2023-12-24 22:10:05,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:10:05,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:10:05,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:10:05,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:10:05,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:10:05,279 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-24 22:10:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:05,426 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-12-24 22:10:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 22:10:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 26 [2023-12-24 22:10:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:05,428 INFO L225 Difference]: With dead ends: 68 [2023-12-24 22:10:05,428 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 22:10:05,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:10:05,429 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:10:05,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:10:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 22:10:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-12-24 22:10:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 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-24 22:10:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2023-12-24 22:10:05,435 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2023-12-24 22:10:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:05,435 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2023-12-24 22:10:05,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-24 22:10:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2023-12-24 22:10:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-24 22:10:05,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:10:05,438 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2023-12-24 22:10:05,443 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-24 22:10:05,639 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-24 22:10:05,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:10:05,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:10:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1411171347, now seen corresponding path program 3 times [2023-12-24 22:10:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:10:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393637] [2023-12-24 22:10:05,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:10:05,640 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-24 22:10:05,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:10:05,646 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-24 22:10:05,648 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-24 22:10:05,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-24 22:10:05,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 22:10:05,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 22:10:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 22:10:05,753 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 22:10:05,753 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 22:10:05,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:10:05,762 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-24 22:10:05,955 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-24 22:10:05,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-24 22:10:05,961 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:10:05,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:10:05 BoogieIcfgContainer [2023-12-24 22:10:05,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:10:05,981 INFO L158 Benchmark]: Toolchain (without parser) took 3300.68ms. Allocated memory is still 248.5MB. Free memory was 210.3MB in the beginning and 130.5MB in the end (delta: 79.8MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,982 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:10:05,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.21ms. Allocated memory is still 248.5MB. Free memory was 209.9MB in the beginning and 199.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.48ms. Allocated memory is still 248.5MB. Free memory was 199.2MB in the beginning and 197.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,982 INFO L158 Benchmark]: Boogie Preprocessor took 22.91ms. Allocated memory is still 248.5MB. Free memory was 197.7MB in the beginning and 196.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,982 INFO L158 Benchmark]: RCFGBuilder took 296.06ms. Allocated memory is still 248.5MB. Free memory was 196.1MB in the beginning and 185.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,983 INFO L158 Benchmark]: TraceAbstraction took 2790.59ms. Allocated memory is still 248.5MB. Free memory was 184.7MB in the beginning and 130.5MB in the end (delta: 54.2MB). Peak memory consumption was 55.1MB. Max. memory is 8.0GB. [2023-12-24 22:10:05,984 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.13ms. Allocated memory is still 174.1MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.21ms. Allocated memory is still 248.5MB. Free memory was 209.9MB in the beginning and 199.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.48ms. Allocated memory is still 248.5MB. Free memory was 199.2MB in the beginning and 197.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.91ms. Allocated memory is still 248.5MB. Free memory was 197.7MB in the beginning and 196.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 296.06ms. Allocated memory is still 248.5MB. Free memory was 196.1MB in the beginning and 185.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2790.59ms. Allocated memory is still 248.5MB. Free memory was 184.7MB in the beginning and 130.5MB in the end (delta: 54.2MB). Peak memory consumption was 55.1MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [sn=0, x=0] [L24] COND TRUE 1 VAL [sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=2, x=0] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=4, x=1] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=6, x=2] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=8, x=3] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=10, x=4] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=12, x=5] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=14, x=6] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=16, x=7] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=18, x=8] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=20, x=9] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=20, x=10] [L25] COND FALSE !(x<10) VAL [sn=20, x=10] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 39 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 417 SizeOfPredicates, 6 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 20/108 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-24 22:10:05,996 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...