/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/recursive-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:46:02,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:46:02,122 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 17:46:02,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:46:02,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:46:02,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:46:02,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:46:02,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:46:02,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:46:02,157 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:46:02,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:46:02,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:46:02,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:46:02,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:46:02,159 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:46:02,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:46:02,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:46:02,159 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:46:02,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:46:02,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:46:02,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:46:02,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:46:02,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:46:02,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:46:02,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:46:02,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:46:02,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:46:02,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:46:02,164 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:46:02,164 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 17:46:02,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:46:02,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:46:02,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:46:02,331 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:46:02,331 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:46:02,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2023-12-16 17:46:03,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:46:03,482 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:46:03,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2023-12-16 17:46:03,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcb002a9/df0c5480059545bb837767c8dae318c7/FLAG6f60d1e9d [2023-12-16 17:46:03,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcb002a9/df0c5480059545bb837767c8dae318c7 [2023-12-16 17:46:03,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:46:03,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:46:03,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:46:03,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:46:03,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:46:03,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244fda10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03, skipping insertion in model container [2023-12-16 17:46:03,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:46:03,644 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c[548,561] [2023-12-16 17:46:03,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:46:03,657 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:46:03,666 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c[548,561] [2023-12-16 17:46:03,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:46:03,676 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:46:03,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03 WrapperNode [2023-12-16 17:46:03,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:46:03,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:46:03,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:46:03,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:46:03,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,696 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2023-12-16 17:46:03,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:46:03,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:46:03,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:46:03,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:46:03,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,712 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 17:46:03,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:46:03,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:46:03,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:46:03,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:46:03,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (1/1) ... [2023-12-16 17:46:03,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:46:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:46:03,750 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 17:46:03,756 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 17:46:03,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:46:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:46:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2023-12-16 17:46:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2023-12-16 17:46:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:46:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:46:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-12-16 17:46:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-12-16 17:46:03,812 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:46:03,814 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:46:04,011 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:46:04,029 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:46:04,029 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 17:46:04,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:46:04 BoogieIcfgContainer [2023-12-16 17:46:04,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:46:04,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:46:04,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:46:04,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:46:04,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:46:03" (1/3) ... [2023-12-16 17:46:04,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d49f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:46:04, skipping insertion in model container [2023-12-16 17:46:04,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:46:03" (2/3) ... [2023-12-16 17:46:04,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d49f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:46:04, skipping insertion in model container [2023-12-16 17:46:04,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:46:04" (3/3) ... [2023-12-16 17:46:04,039 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2023-12-16 17:46:04,052 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:46:04,054 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:46:04,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:46:04,091 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;@78fb89b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:46:04,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:46:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 17:46:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 17:46:04,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:04,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:04,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:04,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash -406374326, now seen corresponding path program 1 times [2023-12-16 17:46:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425463677] [2023-12-16 17:46:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:46:04,112 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 17:46:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:04,113 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 17:46:04,115 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 17:46:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:46:04,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:46:04,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:46:04,210 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 17:46:04,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:46:04,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:46:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425463677] [2023-12-16 17:46:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425463677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:46:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:46:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:46:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721736839] [2023-12-16 17:46:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:46:04,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:46:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:46:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:46:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:46:04,236 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:46:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:46:04,281 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-16 17:46:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:46:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-16 17:46:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:46:04,287 INFO L225 Difference]: With dead ends: 28 [2023-12-16 17:46:04,287 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 17:46:04,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:46:04,291 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:46:04,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:46:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 17:46:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 17:46:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 17:46:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-12-16 17:46:04,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2023-12-16 17:46:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:46:04,315 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-12-16 17:46:04,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:46:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-12-16 17:46:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:46:04,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:04,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:04,320 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 17:46:04,519 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 17:46:04,520 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:04,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -911562000, now seen corresponding path program 1 times [2023-12-16 17:46:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68754024] [2023-12-16 17:46:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:46:04,521 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 17:46:04,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:04,522 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 17:46:04,522 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 17:46:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:46:04,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:46:04,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:46:04,622 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 17:46:04,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:46:04,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:46:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68754024] [2023-12-16 17:46:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68754024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:46:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:46:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 17:46:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084394490] [2023-12-16 17:46:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:46:04,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 17:46:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:46:04,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 17:46:04,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:46:04,625 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:46:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:46:04,716 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-12-16 17:46:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:46:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-12-16 17:46:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:46:04,718 INFO L225 Difference]: With dead ends: 29 [2023-12-16 17:46:04,718 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 17:46:04,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 17:46:04,720 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:46:04,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:46:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 17:46:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-16 17:46:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 17:46:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-16 17:46:04,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-12-16 17:46:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:46:04,731 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-16 17:46:04,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:46:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-16 17:46:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 17:46:04,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:04,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:04,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 17:46:04,934 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 17:46:04,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:04,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -941711854, now seen corresponding path program 1 times [2023-12-16 17:46:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:04,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746748816] [2023-12-16 17:46:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:46:04,936 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 17:46:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:04,936 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 17:46:04,953 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 17:46:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:46:04,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:46:04,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:46:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:46:05,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:46:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 17:46:05,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:46:05,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746748816] [2023-12-16 17:46:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746748816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:46:05,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:46:05,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-16 17:46:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949970325] [2023-12-16 17:46:05,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:46:05,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:46:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:46:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:46:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:46:05,275 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:46:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:46:05,347 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-16 17:46:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:46:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-12-16 17:46:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:46:05,348 INFO L225 Difference]: With dead ends: 35 [2023-12-16 17:46:05,349 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 17:46:05,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:46:05,350 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:46:05,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:46:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 17:46:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2023-12-16 17:46:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 17:46:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-16 17:46:05,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2023-12-16 17:46:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:46:05,354 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-16 17:46:05,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:46:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-16 17:46:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:46:05,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:05,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:05,359 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 17:46:05,556 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 17:46:05,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:05,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1503676104, now seen corresponding path program 1 times [2023-12-16 17:46:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040179569] [2023-12-16 17:46:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:46:05,558 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 17:46:05,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:05,562 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 17:46:05,563 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 17:46:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:46:05,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:46:05,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:46:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 17:46:05,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:46:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:46:05,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:46:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040179569] [2023-12-16 17:46:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040179569] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:46:05,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:46:05,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-16 17:46:05,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372645216] [2023-12-16 17:46:05,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:46:05,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:46:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:46:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:46:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:46:05,933 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 17:46:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:46:06,037 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2023-12-16 17:46:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 17:46:06,038 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 27 [2023-12-16 17:46:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:46:06,039 INFO L225 Difference]: With dead ends: 41 [2023-12-16 17:46:06,039 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 17:46:06,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-16 17:46:06,043 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:46:06,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:46:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 17:46:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-16 17:46:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 17:46:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-16 17:46:06,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2023-12-16 17:46:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:46:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-16 17:46:06,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 17:46:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-16 17:46:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 17:46:06,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:06,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:06,058 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 17:46:06,255 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 17:46:06,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1206630438, now seen corresponding path program 2 times [2023-12-16 17:46:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447526936] [2023-12-16 17:46:06,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:46:06,257 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 17:46:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:06,258 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 17:46:06,262 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 17:46:06,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:46:06,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:46:06,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 17:46:06,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:46:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 17:46:06,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:46:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:46:06,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:46:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447526936] [2023-12-16 17:46:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447526936] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:46:06,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:46:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-16 17:46:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259439088] [2023-12-16 17:46:06,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:46:06,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 17:46:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:46:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 17:46:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:46:06,708 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-16 17:46:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:46:06,838 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-12-16 17:46:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:46:06,838 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) Word has length 33 [2023-12-16 17:46:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:46:06,839 INFO L225 Difference]: With dead ends: 47 [2023-12-16 17:46:06,839 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 17:46:06,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-16 17:46:06,840 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:46:06,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:46:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 17:46:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-12-16 17:46:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 17:46:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-12-16 17:46:06,844 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2023-12-16 17:46:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:46:06,845 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-12-16 17:46:06,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-16 17:46:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-12-16 17:46:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 17:46:06,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:46:06,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:46:06,929 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 17:46:07,047 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 17:46:07,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:46:07,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:46:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash -415290496, now seen corresponding path program 2 times [2023-12-16 17:46:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:46:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556289336] [2023-12-16 17:46:07,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:46:07,050 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 17:46:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:46:07,051 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 17:46:07,052 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 17:46:07,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:46:07,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 17:46:07,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 17:46:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 17:46:07,108 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 17:46:07,108 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 17:46:07,109 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:46:07,117 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 (7)] Ended with exit code 0 [2023-12-16 17:46:07,310 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 17:46:07,313 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2023-12-16 17:46:07,316 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:46:07,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:46:07 BoogieIcfgContainer [2023-12-16 17:46:07,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:46:07,335 INFO L158 Benchmark]: Toolchain (without parser) took 3836.95ms. Allocated memory is still 273.7MB. Free memory was 225.8MB in the beginning and 207.9MB in the end (delta: 17.9MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2023-12-16 17:46:07,335 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 208.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:46:07,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.75ms. Allocated memory is still 273.7MB. Free memory was 225.8MB in the beginning and 214.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:46:07,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.45ms. Allocated memory is still 273.7MB. Free memory was 214.8MB in the beginning and 213.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:46:07,336 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 273.7MB. Free memory was 213.2MB in the beginning and 211.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:46:07,336 INFO L158 Benchmark]: RCFGBuilder took 311.10ms. Allocated memory is still 273.7MB. Free memory was 211.6MB in the beginning and 200.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:46:07,336 INFO L158 Benchmark]: TraceAbstraction took 3304.00ms. Allocated memory is still 273.7MB. Free memory was 199.6MB in the beginning and 207.9MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:46:07,337 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.10ms. Allocated memory is still 208.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.75ms. Allocated memory is still 273.7MB. Free memory was 225.8MB in the beginning and 214.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.45ms. Allocated memory is still 273.7MB. Free memory was 214.8MB in the beginning and 213.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 273.7MB. Free memory was 213.2MB in the beginning and 211.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 311.10ms. Allocated memory is still 273.7MB. Free memory was 211.6MB in the beginning and 200.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3304.00ms. Allocated memory is still 273.7MB. Free memory was 199.6MB in the beginning and 207.9MB in the end (delta: -8.3MB). There was no memory consumed. 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: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int input = 5; VAL [input=5] [L21] CALL, EXPR id(input) VAL [\old(x)=5] [L10] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L15] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L16] CALL, EXPR id(x-1) VAL [\old(x)=3] [L10] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L15] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L16] CALL, EXPR id(x-1) VAL [\old(x)=1] [L10] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L15] COND TRUE x==0 [L15] return 0; VAL [\old(x)=0, \result=0, x=0] [L11] RET, EXPR id2(x-1) VAL [\old(x)=1, x=1] [L11] return id2(x-1) + 1; [L16] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L16] return id(x-1) + 1; [L11] RET, EXPR id2(x-1) VAL [\old(x)=3, x=3] [L11] return id2(x-1) + 1; [L16] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L16] return id(x-1) + 1; [L11] RET, EXPR id2(x-1) VAL [\old(x)=5, x=5] [L11] return id2(x-1) + 1; [L21] RET, EXPR id(input) VAL [input=5] [L21] int result = id(input); [L22] COND TRUE result == 5 VAL [input=5, result=5] [L23] reach_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 80 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 39, 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, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 SizeOfPredicates, 15 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 24/68 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-16 17:46:07,354 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...