/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:38:55,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:38:55,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:38:55,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:38:55,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:38:55,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:38:55,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:38:55,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:38:55,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:38:55,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:38:55,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:38:55,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:38:55,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:38:55,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:38:55,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:38:55,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:38:55,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:38:55,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:38:55,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:38:55,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:38:55,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:38:55,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:38:55,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:38:55,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:38:55,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:38:55,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:38:55,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:38:55,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:38:55,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:38:55,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:38:55,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:38:55,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:38:55,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:38:55,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:38:55,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:38:55,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:38:55,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:38:55,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:38:55,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:38:55,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:38:55,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:38:55,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:38:55,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:38:55,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:38:55,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:38:55,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:38:55,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:38:55,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:38:55,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:38:55,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:38:55,482 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:38:55,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:38:55,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:38:55,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:38:55,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:38:55,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:38:55,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:38:55,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:38:55,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:38:55,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:38:55,485 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:38:55,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:38:55,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:38:55,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:38:55,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:38:55,708 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:38:55,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2022-01-10 06:38:55,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38e0136d/af40ec5332894e3ba684598cb7948f5a/FLAG0d2aa9ede [2022-01-10 06:38:56,077 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:38:56,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2022-01-10 06:38:56,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38e0136d/af40ec5332894e3ba684598cb7948f5a/FLAG0d2aa9ede [2022-01-10 06:38:56,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38e0136d/af40ec5332894e3ba684598cb7948f5a [2022-01-10 06:38:56,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:38:56,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:38:56,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:38:56,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:38:56,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:38:56,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6e8f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56, skipping insertion in model container [2022-01-10 06:38:56,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:38:56,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:38:56,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-01-10 06:38:56,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:38:56,295 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:38:56,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c[947,960] [2022-01-10 06:38:56,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:38:56,321 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:38:56,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56 WrapperNode [2022-01-10 06:38:56,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:38:56,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:38:56,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:38:56,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:38:56,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,342 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-01-10 06:38:56,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:38:56,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:38:56,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:38:56,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:38:56,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:38:56,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:38:56,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:38:56,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:38:56,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (1/1) ... [2022-01-10 06:38:56,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:38:56,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:38:56,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:38:56,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:38:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:38:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:38:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-01-10 06:38:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-01-10 06:38:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-01-10 06:38:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-01-10 06:38:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:38:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:38:56,481 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:38:56,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:38:56,588 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:38:56,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:38:56,593 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 06:38:56,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:38:56 BoogieIcfgContainer [2022-01-10 06:38:56,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:38:56,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:38:56,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:38:56,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:38:56,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:38:56" (1/3) ... [2022-01-10 06:38:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a8f3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:38:56, skipping insertion in model container [2022-01-10 06:38:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:38:56" (2/3) ... [2022-01-10 06:38:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a8f3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:38:56, skipping insertion in model container [2022-01-10 06:38:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:38:56" (3/3) ... [2022-01-10 06:38:56,599 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-01-10 06:38:56,602 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:38:56,603 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:38:56,636 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:38:56,641 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:38:56,641 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:38:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:38:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 06:38:56,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:56,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:56,670 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1014607960, now seen corresponding path program 1 times [2022-01-10 06:38:56,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:56,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340594389] [2022-01-10 06:38:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:56,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:56,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:56,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:38:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:56,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:38:56,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:38:56,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:38:56,833 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:38:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340594389] [2022-01-10 06:38:56,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340594389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:38:56,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:38:56,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:38:56,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139921975] [2022-01-10 06:38:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:38:56,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:38:56,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:38:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:38:56,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:38:56,861 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-01-10 06:38:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:38:56,908 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-01-10 06:38:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:38:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-01-10 06:38:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:38:56,914 INFO L225 Difference]: With dead ends: 37 [2022-01-10 06:38:56,914 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:38:56,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:38:56,918 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:38:56,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:38:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:38:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 06:38:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 06:38:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-10 06:38:56,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 10 [2022-01-10 06:38:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:38:56,943 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-10 06:38:56,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-01-10 06:38:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-10 06:38:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:38:56,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:56,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:56,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:38:57,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:38:57,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2131805067, now seen corresponding path program 1 times [2022-01-10 06:38:57,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:57,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623854478] [2022-01-10 06:38:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:57,154 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:57,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:57,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:38:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:57,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:38:57,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:38:57,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:38:57,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:38:57,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623854478] [2022-01-10 06:38:57,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623854478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:38:57,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:38:57,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:38:57,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331129480] [2022-01-10 06:38:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:38:57,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:38:57,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:38:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:38:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:38:57,261 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-01-10 06:38:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:38:57,333 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-01-10 06:38:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:38:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-01-10 06:38:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:38:57,334 INFO L225 Difference]: With dead ends: 31 [2022-01-10 06:38:57,335 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 06:38:57,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:38:57,337 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:38:57,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:38:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 06:38:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-01-10 06:38:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 06:38:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-01-10 06:38:57,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 11 [2022-01-10 06:38:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:38:57,342 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-01-10 06:38:57,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-01-10 06:38:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-01-10 06:38:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 06:38:57,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:57,343 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:57,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:38:57,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:38:57,568 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1494555912, now seen corresponding path program 1 times [2022-01-10 06:38:57,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:57,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491773507] [2022-01-10 06:38:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:57,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:57,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:57,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:57,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:38:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:57,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:38:57,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:38:57,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:38:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:38:57,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:38:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491773507] [2022-01-10 06:38:57,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491773507] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:38:57,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:38:57,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-01-10 06:38:57,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865618751] [2022-01-10 06:38:57,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:38:57,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:38:57,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:38:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:38:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:38:57,908 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:38:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:38:58,055 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-01-10 06:38:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:38:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2022-01-10 06:38:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:38:58,056 INFO L225 Difference]: With dead ends: 37 [2022-01-10 06:38:58,057 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 06:38:58,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:38:58,058 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:38:58,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:38:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 06:38:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-01-10 06:38:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2022-01-10 06:38:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-01-10 06:38:58,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 22 [2022-01-10 06:38:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:38:58,069 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-01-10 06:38:58,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:38:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-01-10 06:38:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:38:58,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:58,073 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:58,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:38:58,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:38:58,279 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 814571350, now seen corresponding path program 1 times [2022-01-10 06:38:58,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:58,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257015363] [2022-01-10 06:38:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:58,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:58,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:58,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:38:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:58,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:38:58,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:38:58,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:38:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:38:58,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:38:58,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257015363] [2022-01-10 06:38:58,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257015363] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:38:58,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:38:58,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-01-10 06:38:58,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512066763] [2022-01-10 06:38:58,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:38:58,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:38:58,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:38:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:38:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:38:58,580 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:38:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:38:58,700 INFO L93 Difference]: Finished difference Result 61 states and 96 transitions. [2022-01-10 06:38:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:38:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2022-01-10 06:38:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:38:58,702 INFO L225 Difference]: With dead ends: 61 [2022-01-10 06:38:58,702 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 06:38:58,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:38:58,703 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:38:58,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 115 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:38:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 06:38:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-10 06:38:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2022-01-10 06:38:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-01-10 06:38:58,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 23 [2022-01-10 06:38:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:38:58,710 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2022-01-10 06:38:58,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:38:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2022-01-10 06:38:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 06:38:58,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:58,712 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:58,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 06:38:58,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:38:58,918 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1581983960, now seen corresponding path program 1 times [2022-01-10 06:38:58,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:58,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478261003] [2022-01-10 06:38:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:58,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:58,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:58,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:58,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:38:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:58,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:38:58,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:38:59,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:38:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:38:59,399 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:38:59,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478261003] [2022-01-10 06:38:59,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478261003] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:38:59,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:38:59,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-01-10 06:38:59,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245987421] [2022-01-10 06:38:59,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:38:59,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:38:59,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:38:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:38:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:38:59,401 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 06:38:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:38:59,602 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2022-01-10 06:38:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:38:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 34 [2022-01-10 06:38:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:38:59,604 INFO L225 Difference]: With dead ends: 49 [2022-01-10 06:38:59,604 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:38:59,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:38:59,605 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:38:59,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 153 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:38:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:38:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-01-10 06:38:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2022-01-10 06:38:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-01-10 06:38:59,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 34 [2022-01-10 06:38:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:38:59,618 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-01-10 06:38:59,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 06:38:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-01-10 06:38:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:38:59,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:38:59,627 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:38:59,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:38:59,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:38:59,834 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:38:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:38:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1656487097, now seen corresponding path program 1 times [2022-01-10 06:38:59,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:38:59,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216909132] [2022-01-10 06:38:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:38:59,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:38:59,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:38:59,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:38:59,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:38:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:38:59,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:38:59,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:38:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:38:59,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:39:00,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:00,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216909132] [2022-01-10 06:39:00,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216909132] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:00,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:00,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-01-10 06:39:00,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504526692] [2022-01-10 06:39:00,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:00,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:39:00,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:39:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:39:00,193 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 06:39:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:00,318 INFO L93 Difference]: Finished difference Result 79 states and 150 transitions. [2022-01-10 06:39:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:39:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2022-01-10 06:39:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:00,320 INFO L225 Difference]: With dead ends: 79 [2022-01-10 06:39:00,320 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 06:39:00,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:39:00,321 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:00,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 152 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 06:39:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 06:39:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 10 states have call successors, (10), 2 states have call predecessors, (10), 9 states have return successors, (37), 14 states have call predecessors, (37), 10 states have call successors, (37) [2022-01-10 06:39:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2022-01-10 06:39:00,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 35 [2022-01-10 06:39:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:00,331 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2022-01-10 06:39:00,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 06:39:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2022-01-10 06:39:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 06:39:00,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:00,336 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:00,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 06:39:00,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:00,568 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 600804856, now seen corresponding path program 2 times [2022-01-10 06:39:00,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:00,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245245682] [2022-01-10 06:39:00,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:00,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:00,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:00,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:00,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:39:00,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:00,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:00,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 06:39:00,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:39:00,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 06:39:01,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:01,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245245682] [2022-01-10 06:39:01,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245245682] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:01,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:01,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2022-01-10 06:39:01,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038635480] [2022-01-10 06:39:01,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:01,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:39:01,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:39:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:39:01,239 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2022-01-10 06:39:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:01,524 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2022-01-10 06:39:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:39:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 46 [2022-01-10 06:39:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:01,526 INFO L225 Difference]: With dead ends: 70 [2022-01-10 06:39:01,526 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 06:39:01,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-01-10 06:39:01,527 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:01,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 06:39:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-01-10 06:39:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 10 states have return successors, (47), 16 states have call predecessors, (47), 11 states have call successors, (47) [2022-01-10 06:39:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 90 transitions. [2022-01-10 06:39:01,541 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 90 transitions. Word has length 46 [2022-01-10 06:39:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:01,541 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 90 transitions. [2022-01-10 06:39:01,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2022-01-10 06:39:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 90 transitions. [2022-01-10 06:39:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:39:01,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:01,543 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:01,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 06:39:01,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:01,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1482129412, now seen corresponding path program 1 times [2022-01-10 06:39:01,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:01,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095728752] [2022-01-10 06:39:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:01,753 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:01,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:01,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:39:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:01,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 06:39:01,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 06:39:01,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 06:39:02,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:02,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095728752] [2022-01-10 06:39:02,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095728752] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:02,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:02,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2022-01-10 06:39:02,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897299274] [2022-01-10 06:39:02,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:02,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:39:02,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:39:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:39:02,463 INFO L87 Difference]: Start difference. First operand 50 states and 90 transitions. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2022-01-10 06:39:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:02,759 INFO L93 Difference]: Finished difference Result 108 states and 252 transitions. [2022-01-10 06:39:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:39:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 47 [2022-01-10 06:39:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:02,761 INFO L225 Difference]: With dead ends: 108 [2022-01-10 06:39:02,761 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 06:39:02,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:39:02,762 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:02,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 208 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 06:39:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-10 06:39:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2022-01-10 06:39:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 120 transitions. [2022-01-10 06:39:02,788 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 120 transitions. Word has length 47 [2022-01-10 06:39:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:02,789 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 120 transitions. [2022-01-10 06:39:02,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2022-01-10 06:39:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 120 transitions. [2022-01-10 06:39:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 06:39:02,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:02,796 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:02,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 06:39:03,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:03,003 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:03,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash -425933224, now seen corresponding path program 3 times [2022-01-10 06:39:03,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:03,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50450207] [2022-01-10 06:39:03,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:03,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:03,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:03,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:39:03,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:39:03,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:03,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:39:03,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 06:39:03,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 06:39:03,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50450207] [2022-01-10 06:39:03,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50450207] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:03,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:03,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-01-10 06:39:03,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446352659] [2022-01-10 06:39:03,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:03,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:39:03,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:03,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:39:03,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:39:03,577 INFO L87 Difference]: Start difference. First operand 61 states and 120 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 06:39:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:03,676 INFO L93 Difference]: Finished difference Result 83 states and 163 transitions. [2022-01-10 06:39:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:39:03,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 58 [2022-01-10 06:39:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:03,677 INFO L225 Difference]: With dead ends: 83 [2022-01-10 06:39:03,677 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 06:39:03,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:39:03,678 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:03,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 06:39:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2022-01-10 06:39:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2022-01-10 06:39:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 120 transitions. [2022-01-10 06:39:03,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 120 transitions. Word has length 58 [2022-01-10 06:39:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:03,690 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 120 transitions. [2022-01-10 06:39:03,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 06:39:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 120 transitions. [2022-01-10 06:39:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 06:39:03,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:03,691 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:03,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:03,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:03,898 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -354787678, now seen corresponding path program 2 times [2022-01-10 06:39:03,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:03,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322975221] [2022-01-10 06:39:03,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:03,899 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:03,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:03,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:39:03,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:03,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:03,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:39:03,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 06:39:04,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 06:39:04,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322975221] [2022-01-10 06:39:04,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322975221] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:04,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:04,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2022-01-10 06:39:04,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927485847] [2022-01-10 06:39:04,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:04,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:39:04,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:39:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:39:04,775 INFO L87 Difference]: Start difference. First operand 61 states and 120 transitions. Second operand has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 16 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-10 06:39:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:05,292 INFO L93 Difference]: Finished difference Result 163 states and 460 transitions. [2022-01-10 06:39:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 06:39:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 16 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) Word has length 59 [2022-01-10 06:39:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:05,294 INFO L225 Difference]: With dead ends: 163 [2022-01-10 06:39:05,294 INFO L226 Difference]: Without dead ends: 105 [2022-01-10 06:39:05,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-01-10 06:39:05,297 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:05,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 181 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:39:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-10 06:39:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2022-01-10 06:39:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 20 states have call successors, (20), 5 states have call predecessors, (20), 22 states have return successors, (150), 33 states have call predecessors, (150), 20 states have call successors, (150) [2022-01-10 06:39:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 232 transitions. [2022-01-10 06:39:05,316 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 232 transitions. Word has length 59 [2022-01-10 06:39:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:05,317 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 232 transitions. [2022-01-10 06:39:05,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.142857142857143) internal successors, (44), 16 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2022-01-10 06:39:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 232 transitions. [2022-01-10 06:39:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 06:39:05,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:05,319 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:05,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:05,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1748552912, now seen corresponding path program 2 times [2022-01-10 06:39:05,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:05,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730027768] [2022-01-10 06:39:05,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:05,527 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:05,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:39:05,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:05,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:05,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:39:05,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-01-10 06:39:05,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-10 06:39:06,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730027768] [2022-01-10 06:39:06,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730027768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:06,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:06,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2022-01-10 06:39:06,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755843515] [2022-01-10 06:39:06,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:06,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:39:06,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:39:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:39:06,204 INFO L87 Difference]: Start difference. First operand 99 states and 232 transitions. Second operand has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2022-01-10 06:39:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:06,409 INFO L93 Difference]: Finished difference Result 209 states and 648 transitions. [2022-01-10 06:39:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:39:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) Word has length 72 [2022-01-10 06:39:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:06,411 INFO L225 Difference]: With dead ends: 209 [2022-01-10 06:39:06,411 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 06:39:06,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:39:06,413 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:06,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 194 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 06:39:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2022-01-10 06:39:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.096774193548387) internal successors, (68), 66 states have internal predecessors, (68), 22 states have call successors, (22), 5 states have call predecessors, (22), 25 states have return successors, (186), 38 states have call predecessors, (186), 22 states have call successors, (186) [2022-01-10 06:39:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 276 transitions. [2022-01-10 06:39:06,428 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 276 transitions. Word has length 72 [2022-01-10 06:39:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:06,429 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 276 transitions. [2022-01-10 06:39:06,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 16 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2022-01-10 06:39:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 276 transitions. [2022-01-10 06:39:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 06:39:06,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:06,431 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:06,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:06,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:06,645 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -971041873, now seen corresponding path program 3 times [2022-01-10 06:39:06,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392281933] [2022-01-10 06:39:06,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:06,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:06,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:06,651 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:06,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:39:06,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 06:39:06,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:06,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 06:39:06,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 229 proven. 5 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-01-10 06:39:06,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 169 proven. 19 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-01-10 06:39:07,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392281933] [2022-01-10 06:39:07,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392281933] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:07,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:07,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-01-10 06:39:07,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45481577] [2022-01-10 06:39:07,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:07,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:39:07,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:39:07,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:39:07,702 INFO L87 Difference]: Start difference. First operand 110 states and 276 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2022-01-10 06:39:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:07,978 INFO L93 Difference]: Finished difference Result 223 states and 708 transitions. [2022-01-10 06:39:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:39:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) Word has length 131 [2022-01-10 06:39:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:07,980 INFO L225 Difference]: With dead ends: 223 [2022-01-10 06:39:07,980 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 06:39:07,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:39:07,982 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:07,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 06:39:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-01-10 06:39:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 22 states have call successors, (22), 5 states have call predecessors, (22), 27 states have return successors, (179), 40 states have call predecessors, (179), 22 states have call successors, (179) [2022-01-10 06:39:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 273 transitions. [2022-01-10 06:39:07,995 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 273 transitions. Word has length 131 [2022-01-10 06:39:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:07,996 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 273 transitions. [2022-01-10 06:39:07,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2022-01-10 06:39:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 273 transitions. [2022-01-10 06:39:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 06:39:07,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:07,999 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:08,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:08,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:08,200 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1871760231, now seen corresponding path program 1 times [2022-01-10 06:39:08,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:08,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875365374] [2022-01-10 06:39:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:08,200 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:08,201 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:08,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 06:39:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:08,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:39:08,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 21 proven. 133 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-01-10 06:39:08,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 21 proven. 147 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-01-10 06:39:09,655 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875365374] [2022-01-10 06:39:09,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875365374] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:09,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:09,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2022-01-10 06:39:09,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012288657] [2022-01-10 06:39:09,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:09,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:39:09,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:39:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:39:09,656 INFO L87 Difference]: Start difference. First operand 116 states and 273 transitions. Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-01-10 06:39:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:10,567 INFO L93 Difference]: Finished difference Result 324 states and 1037 transitions. [2022-01-10 06:39:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 06:39:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.4375) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 109 [2022-01-10 06:39:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:10,570 INFO L225 Difference]: With dead ends: 324 [2022-01-10 06:39:10,571 INFO L226 Difference]: Without dead ends: 209 [2022-01-10 06:39:10,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 06:39:10,573 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:10,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 240 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 06:39:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-10 06:39:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2022-01-10 06:39:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 114 states have (on average 1.105263157894737) internal successors, (126), 118 states have internal predecessors, (126), 35 states have call successors, (35), 13 states have call predecessors, (35), 44 states have return successors, (328), 62 states have call predecessors, (328), 35 states have call successors, (328) [2022-01-10 06:39:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 489 transitions. [2022-01-10 06:39:10,588 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 489 transitions. Word has length 109 [2022-01-10 06:39:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:10,589 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 489 transitions. [2022-01-10 06:39:10,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.4375) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-01-10 06:39:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 489 transitions. [2022-01-10 06:39:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 06:39:10,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:10,591 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:10,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:10,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:10,800 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1266739771, now seen corresponding path program 2 times [2022-01-10 06:39:10,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:10,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995088049] [2022-01-10 06:39:10,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:10,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:10,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:10,802 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:10,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 06:39:10,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:10,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:10,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:39:10,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 51 proven. 191 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-01-10 06:39:11,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 51 proven. 207 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-01-10 06:39:11,913 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:11,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995088049] [2022-01-10 06:39:11,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995088049] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:11,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:11,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2022-01-10 06:39:11,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485745012] [2022-01-10 06:39:11,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:11,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:39:11,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:39:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:39:11,914 INFO L87 Difference]: Start difference. First operand 194 states and 489 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-01-10 06:39:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:12,156 INFO L93 Difference]: Finished difference Result 406 states and 1364 transitions. [2022-01-10 06:39:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:39:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 145 [2022-01-10 06:39:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:12,159 INFO L225 Difference]: With dead ends: 406 [2022-01-10 06:39:12,159 INFO L226 Difference]: Without dead ends: 215 [2022-01-10 06:39:12,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-01-10 06:39:12,162 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:12,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 270 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-10 06:39:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-01-10 06:39:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 126 states have (on average 1.0952380952380953) internal successors, (138), 130 states have internal predecessors, (138), 38 states have call successors, (38), 13 states have call predecessors, (38), 50 states have return successors, (417), 71 states have call predecessors, (417), 38 states have call successors, (417) [2022-01-10 06:39:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 593 transitions. [2022-01-10 06:39:12,199 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 593 transitions. Word has length 145 [2022-01-10 06:39:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:12,200 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 593 transitions. [2022-01-10 06:39:12,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2022-01-10 06:39:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 593 transitions. [2022-01-10 06:39:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-10 06:39:12,205 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:12,205 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 22, 22, 20, 15, 14, 14, 14, 14, 14, 14, 14, 11, 11, 11, 11, 11, 11, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:12,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:12,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:12,415 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -769042422, now seen corresponding path program 3 times [2022-01-10 06:39:12,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861529572] [2022-01-10 06:39:12,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:12,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:12,417 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 06:39:12,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:39:12,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:12,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:39:12,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 411 proven. 2 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2022-01-10 06:39:12,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 413 proven. 1 refuted. 0 times theorem prover too weak. 2867 trivial. 0 not checked. [2022-01-10 06:39:13,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:13,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861529572] [2022-01-10 06:39:13,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861529572] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:13,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:13,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-01-10 06:39:13,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364594306] [2022-01-10 06:39:13,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:13,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:39:13,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:13,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:39:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:39:13,776 INFO L87 Difference]: Start difference. First operand 215 states and 593 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 06:39:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:13,937 INFO L93 Difference]: Finished difference Result 543 states and 2182 transitions. [2022-01-10 06:39:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:39:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 320 [2022-01-10 06:39:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:13,941 INFO L225 Difference]: With dead ends: 543 [2022-01-10 06:39:13,941 INFO L226 Difference]: Without dead ends: 331 [2022-01-10 06:39:13,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:39:13,945 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:13,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 181 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-01-10 06:39:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 225. [2022-01-10 06:39:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 127 states have (on average 1.125984251968504) internal successors, (143), 130 states have internal predecessors, (143), 50 states have call successors, (50), 15 states have call predecessors, (50), 47 states have return successors, (443), 79 states have call predecessors, (443), 50 states have call successors, (443) [2022-01-10 06:39:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 636 transitions. [2022-01-10 06:39:13,973 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 636 transitions. Word has length 320 [2022-01-10 06:39:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:13,973 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 636 transitions. [2022-01-10 06:39:13,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 06:39:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 636 transitions. [2022-01-10 06:39:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-01-10 06:39:13,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:13,978 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 20, 19, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:13,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:14,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:14,185 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 279871242, now seen corresponding path program 4 times [2022-01-10 06:39:14,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678311731] [2022-01-10 06:39:14,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:39:14,186 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:14,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:14,187 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:14,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 06:39:14,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:39:14,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:14,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:39:14,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4313 backedges. 74 proven. 805 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2022-01-10 06:39:14,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4313 backedges. 74 proven. 826 refuted. 0 times theorem prover too weak. 3413 trivial. 0 not checked. [2022-01-10 06:39:16,490 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:16,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678311731] [2022-01-10 06:39:16,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678311731] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:16,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:16,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 20 [2022-01-10 06:39:16,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211613639] [2022-01-10 06:39:16,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:16,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 06:39:16,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 06:39:16,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:39:16,492 INFO L87 Difference]: Start difference. First operand 225 states and 636 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 06:39:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:17,788 INFO L93 Difference]: Finished difference Result 683 states and 3001 transitions. [2022-01-10 06:39:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 06:39:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) Word has length 368 [2022-01-10 06:39:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:17,795 INFO L225 Difference]: With dead ends: 683 [2022-01-10 06:39:17,796 INFO L226 Difference]: Without dead ends: 461 [2022-01-10 06:39:17,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-01-10 06:39:17,800 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:17,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 253 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 06:39:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-01-10 06:39:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 420. [2022-01-10 06:39:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 238 states have (on average 1.1218487394957983) internal successors, (267), 243 states have internal predecessors, (267), 88 states have call successors, (88), 26 states have call predecessors, (88), 93 states have return successors, (1202), 150 states have call predecessors, (1202), 88 states have call successors, (1202) [2022-01-10 06:39:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1557 transitions. [2022-01-10 06:39:17,844 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1557 transitions. Word has length 368 [2022-01-10 06:39:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:17,845 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1557 transitions. [2022-01-10 06:39:17,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 06:39:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1557 transitions. [2022-01-10 06:39:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-01-10 06:39:17,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:17,854 INFO L514 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 18, 17, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 10, 10, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:17,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:18,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:18,078 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 412199969, now seen corresponding path program 5 times [2022-01-10 06:39:18,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:18,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123159115] [2022-01-10 06:39:18,079 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:39:18,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:18,080 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:18,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 06:39:18,137 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 06:39:18,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 06:39:18,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 1047 proven. 6 refuted. 0 times theorem prover too weak. 2659 trivial. 0 not checked. [2022-01-10 06:39:18,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 200 proven. 497 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2022-01-10 06:39:19,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:19,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123159115] [2022-01-10 06:39:19,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123159115] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:19,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:19,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-10 06:39:19,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405133613] [2022-01-10 06:39:19,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:19,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:39:19,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:39:19,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:39:19,838 INFO L87 Difference]: Start difference. First operand 420 states and 1557 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-01-10 06:39:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:19,982 INFO L93 Difference]: Finished difference Result 832 states and 4034 transitions. [2022-01-10 06:39:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:39:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 342 [2022-01-10 06:39:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:19,993 INFO L225 Difference]: With dead ends: 832 [2022-01-10 06:39:19,993 INFO L226 Difference]: Without dead ends: 415 [2022-01-10 06:39:19,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:39:20,000 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:20,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-01-10 06:39:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2022-01-10 06:39:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 230 states have (on average 1.126086956521739) internal successors, (259), 235 states have internal predecessors, (259), 87 states have call successors, (87), 26 states have call predecessors, (87), 89 states have return successors, (1121), 145 states have call predecessors, (1121), 87 states have call successors, (1121) [2022-01-10 06:39:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1467 transitions. [2022-01-10 06:39:20,103 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1467 transitions. Word has length 342 [2022-01-10 06:39:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:20,104 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 1467 transitions. [2022-01-10 06:39:20,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 7 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-01-10 06:39:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1467 transitions. [2022-01-10 06:39:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-01-10 06:39:20,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:20,113 INFO L514 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 21, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:20,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:20,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:20,322 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1329585960, now seen corresponding path program 6 times [2022-01-10 06:39:20,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:20,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367571567] [2022-01-10 06:39:20,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 06:39:20,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:20,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:20,324 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:20,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 06:39:20,462 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-10 06:39:20,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:20,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:39:20,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 5003 trivial. 0 not checked. [2022-01-10 06:39:21,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:39:21,029 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:21,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367571567] [2022-01-10 06:39:21,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367571567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:39:21,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:39:21,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:39:21,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9791163] [2022-01-10 06:39:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:39:21,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:39:21,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:21,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:39:21,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:39:21,030 INFO L87 Difference]: Start difference. First operand 407 states and 1467 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 06:39:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:21,083 INFO L93 Difference]: Finished difference Result 670 states and 2824 transitions. [2022-01-10 06:39:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:39:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 423 [2022-01-10 06:39:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:21,086 INFO L225 Difference]: With dead ends: 670 [2022-01-10 06:39:21,086 INFO L226 Difference]: Without dead ends: 243 [2022-01-10 06:39:21,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:39:21,091 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:21,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 83 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:39:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-10 06:39:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 210. [2022-01-10 06:39:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 118 states have (on average 1.1101694915254237) internal successors, (131), 119 states have internal predecessors, (131), 50 states have call successors, (50), 15 states have call predecessors, (50), 41 states have return successors, (346), 75 states have call predecessors, (346), 50 states have call successors, (346) [2022-01-10 06:39:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 527 transitions. [2022-01-10 06:39:21,117 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 527 transitions. Word has length 423 [2022-01-10 06:39:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:21,117 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 527 transitions. [2022-01-10 06:39:21,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 06:39:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 527 transitions. [2022-01-10 06:39:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-01-10 06:39:21,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:21,120 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 14, 14, 12, 11, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:21,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:21,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:21,327 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1276187581, now seen corresponding path program 7 times [2022-01-10 06:39:21,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046780633] [2022-01-10 06:39:21,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 06:39:21,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:21,344 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:21,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 06:39:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:39:21,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 87 proven. 355 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2022-01-10 06:39:21,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 87 proven. 379 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2022-01-10 06:39:22,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046780633] [2022-01-10 06:39:22,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046780633] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:22,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:22,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 20 [2022-01-10 06:39:22,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615289691] [2022-01-10 06:39:22,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:22,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 06:39:22,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 06:39:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:39:22,895 INFO L87 Difference]: Start difference. First operand 210 states and 527 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 06:39:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:23,162 INFO L93 Difference]: Finished difference Result 461 states and 1540 transitions. [2022-01-10 06:39:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:39:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) Word has length 206 [2022-01-10 06:39:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:23,166 INFO L225 Difference]: With dead ends: 461 [2022-01-10 06:39:23,166 INFO L226 Difference]: Without dead ends: 254 [2022-01-10 06:39:23,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2022-01-10 06:39:23,169 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 39 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:23,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 313 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-10 06:39:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 234. [2022-01-10 06:39:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 130 states have (on average 1.1) internal successors, (143), 131 states have internal predecessors, (143), 56 states have call successors, (56), 15 states have call predecessors, (56), 47 states have return successors, (458), 87 states have call predecessors, (458), 56 states have call successors, (458) [2022-01-10 06:39:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 657 transitions. [2022-01-10 06:39:23,196 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 657 transitions. Word has length 206 [2022-01-10 06:39:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:23,196 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 657 transitions. [2022-01-10 06:39:23,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 17 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 8 states have call predecessors, (24), 17 states have call successors, (24) [2022-01-10 06:39:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 657 transitions. [2022-01-10 06:39:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2022-01-10 06:39:23,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:23,201 INFO L514 BasicCegarLoop]: trace histogram [45, 45, 32, 32, 28, 23, 22, 22, 22, 22, 22, 22, 22, 16, 16, 16, 16, 16, 16, 7, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:23,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-01-10 06:39:23,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:23,408 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:23,409 INFO L85 PathProgramCache]: Analyzing trace with hash 831484129, now seen corresponding path program 8 times [2022-01-10 06:39:23,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:23,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938207834] [2022-01-10 06:39:23,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:23,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:23,412 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 06:39:23,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:23,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:39:23,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 157 proven. 1049 refuted. 0 times theorem prover too weak. 6422 trivial. 0 not checked. [2022-01-10 06:39:24,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 157 proven. 1070 refuted. 0 times theorem prover too weak. 6401 trivial. 0 not checked. [2022-01-10 06:39:26,542 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:26,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938207834] [2022-01-10 06:39:26,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938207834] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:26,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:26,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 20 [2022-01-10 06:39:26,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275313096] [2022-01-10 06:39:26,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:26,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 06:39:26,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 06:39:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:39:26,544 INFO L87 Difference]: Start difference. First operand 234 states and 657 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (25), 10 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-10 06:39:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:27,788 INFO L93 Difference]: Finished difference Result 935 states and 5591 transitions. [2022-01-10 06:39:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 06:39:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (25), 10 states have call predecessors, (25), 16 states have call successors, (25) Word has length 479 [2022-01-10 06:39:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:27,804 INFO L225 Difference]: With dead ends: 935 [2022-01-10 06:39:27,804 INFO L226 Difference]: Without dead ends: 704 [2022-01-10 06:39:27,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=1245, Unknown=0, NotChecked=0, Total=1482 [2022-01-10 06:39:27,811 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:27,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 211 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 06:39:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-01-10 06:39:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 573. [2022-01-10 06:39:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 315 states have (on average 1.0761904761904761) internal successors, (339), 315 states have internal predecessors, (339), 131 states have call successors, (131), 27 states have call predecessors, (131), 126 states have return successors, (2544), 230 states have call predecessors, (2544), 131 states have call successors, (2544) [2022-01-10 06:39:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 3014 transitions. [2022-01-10 06:39:27,951 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 3014 transitions. Word has length 479 [2022-01-10 06:39:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:27,952 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 3014 transitions. [2022-01-10 06:39:27,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (25), 10 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-10 06:39:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 3014 transitions. [2022-01-10 06:39:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-01-10 06:39:27,965 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:27,965 INFO L514 BasicCegarLoop]: trace histogram [39, 39, 26, 26, 23, 21, 19, 19, 19, 19, 19, 19, 18, 13, 13, 13, 13, 13, 13, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:27,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:28,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:28,176 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -56896755, now seen corresponding path program 9 times [2022-01-10 06:39:28,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:28,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118647932] [2022-01-10 06:39:28,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:28,177 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:28,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:28,178 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:28,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 06:39:28,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:39:28,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:28,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:39:28,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 4808 trivial. 0 not checked. [2022-01-10 06:39:28,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:39:28,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:28,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118647932] [2022-01-10 06:39:28,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118647932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:39:28,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:39:28,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:39:28,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172771903] [2022-01-10 06:39:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:39:28,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:39:28,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:39:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:39:28,643 INFO L87 Difference]: Start difference. First operand 573 states and 3014 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 06:39:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:28,711 INFO L93 Difference]: Finished difference Result 835 states and 4551 transitions. [2022-01-10 06:39:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:39:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 403 [2022-01-10 06:39:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:28,715 INFO L225 Difference]: With dead ends: 835 [2022-01-10 06:39:28,715 INFO L226 Difference]: Without dead ends: 252 [2022-01-10 06:39:28,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:39:28,727 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:28,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:39:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-10 06:39:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2022-01-10 06:39:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 129 states have internal predecessors, (140), 46 states have call successors, (46), 15 states have call predecessors, (46), 46 states have return successors, (358), 77 states have call predecessors, (358), 46 states have call successors, (358) [2022-01-10 06:39:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 544 transitions. [2022-01-10 06:39:28,745 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 544 transitions. Word has length 403 [2022-01-10 06:39:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:28,746 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 544 transitions. [2022-01-10 06:39:28,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 06:39:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 544 transitions. [2022-01-10 06:39:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2022-01-10 06:39:28,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:28,751 INFO L514 BasicCegarLoop]: trace histogram [53, 53, 44, 44, 37, 36, 26, 26, 26, 26, 26, 26, 22, 22, 22, 22, 22, 22, 16, 15, 10, 8, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:28,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:28,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:28,958 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1521674313, now seen corresponding path program 10 times [2022-01-10 06:39:28,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:28,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505013630] [2022-01-10 06:39:28,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:39:28,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:28,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:28,960 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:28,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 06:39:29,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:39:29,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:29,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:39:29,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12260 backedges. 243 proven. 905 refuted. 0 times theorem prover too weak. 11112 trivial. 0 not checked. [2022-01-10 06:39:29,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12260 backedges. 243 proven. 915 refuted. 0 times theorem prover too weak. 11102 trivial. 0 not checked. [2022-01-10 06:39:31,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:31,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505013630] [2022-01-10 06:39:31,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505013630] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:31,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:31,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2022-01-10 06:39:31,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449410532] [2022-01-10 06:39:31,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:31,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:39:31,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:39:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:39:31,411 INFO L87 Difference]: Start difference. First operand 222 states and 544 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2022-01-10 06:39:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:31,699 INFO L93 Difference]: Finished difference Result 505 states and 1617 transitions. [2022-01-10 06:39:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:39:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 611 [2022-01-10 06:39:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:31,704 INFO L225 Difference]: With dead ends: 505 [2022-01-10 06:39:31,704 INFO L226 Difference]: Without dead ends: 286 [2022-01-10 06:39:31,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1204 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:39:31,709 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:31,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 264 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-10 06:39:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 277. [2022-01-10 06:39:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.069182389937107) internal successors, (170), 159 states have internal predecessors, (170), 56 states have call successors, (56), 15 states have call predecessors, (56), 61 states have return successors, (579), 102 states have call predecessors, (579), 56 states have call successors, (579) [2022-01-10 06:39:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 805 transitions. [2022-01-10 06:39:31,735 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 805 transitions. Word has length 611 [2022-01-10 06:39:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:31,735 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 805 transitions. [2022-01-10 06:39:31,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2022-01-10 06:39:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 805 transitions. [2022-01-10 06:39:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2022-01-10 06:39:31,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:31,741 INFO L514 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 40, 38, 28, 28, 28, 28, 28, 28, 24, 24, 24, 24, 24, 24, 19, 14, 12, 8, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:31,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:31,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:31,952 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash -369966226, now seen corresponding path program 11 times [2022-01-10 06:39:31,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136176406] [2022-01-10 06:39:31,953 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:39:31,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:31,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:31,954 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:31,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 06:39:32,094 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-10 06:39:32,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:32,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 06:39:32,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14341 backedges. 5422 proven. 20 refuted. 0 times theorem prover too weak. 8899 trivial. 0 not checked. [2022-01-10 06:39:32,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14341 backedges. 503 proven. 1213 refuted. 0 times theorem prover too weak. 12625 trivial. 0 not checked. [2022-01-10 06:39:34,158 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:34,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136176406] [2022-01-10 06:39:34,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136176406] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:34,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:34,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2022-01-10 06:39:34,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089651167] [2022-01-10 06:39:34,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:34,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:39:34,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:34,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:39:34,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:39:34,160 INFO L87 Difference]: Start difference. First operand 277 states and 805 transitions. Second operand has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (26), 7 states have call predecessors, (26), 12 states have call successors, (26) [2022-01-10 06:39:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:34,367 INFO L93 Difference]: Finished difference Result 430 states and 1412 transitions. [2022-01-10 06:39:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 06:39:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (26), 7 states have call predecessors, (26), 12 states have call successors, (26) Word has length 660 [2022-01-10 06:39:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:34,369 INFO L225 Difference]: With dead ends: 430 [2022-01-10 06:39:34,369 INFO L226 Difference]: Without dead ends: 142 [2022-01-10 06:39:34,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1327 GetRequests, 1304 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-01-10 06:39:34,372 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:34,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 194 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-10 06:39:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2022-01-10 06:39:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 74 states have internal predecessors, (80), 23 states have call successors, (23), 10 states have call predecessors, (23), 23 states have return successors, (108), 37 states have call predecessors, (108), 23 states have call successors, (108) [2022-01-10 06:39:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 211 transitions. [2022-01-10 06:39:34,380 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 211 transitions. Word has length 660 [2022-01-10 06:39:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:34,381 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 211 transitions. [2022-01-10 06:39:34,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (26), 7 states have call predecessors, (26), 12 states have call successors, (26) [2022-01-10 06:39:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 211 transitions. [2022-01-10 06:39:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-01-10 06:39:34,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:34,383 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 21, 20, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 9, 7, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:34,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:34,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:34,590 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1807188383, now seen corresponding path program 12 times [2022-01-10 06:39:34,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:34,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469465076] [2022-01-10 06:39:34,591 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 06:39:34,591 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:34,593 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:34,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 06:39:34,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-01-10 06:39:34,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:34,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:39:34,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3340 backedges. 491 proven. 85 refuted. 0 times theorem prover too weak. 2764 trivial. 0 not checked. [2022-01-10 06:39:35,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3340 backedges. 491 proven. 95 refuted. 0 times theorem prover too weak. 2754 trivial. 0 not checked. [2022-01-10 06:39:35,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469465076] [2022-01-10 06:39:35,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469465076] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:35,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:35,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2022-01-10 06:39:35,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440488400] [2022-01-10 06:39:35,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:35,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:39:35,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:39:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:39:35,877 INFO L87 Difference]: Start difference. First operand 122 states and 211 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) [2022-01-10 06:39:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:36,065 INFO L93 Difference]: Finished difference Result 147 states and 264 transitions. [2022-01-10 06:39:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:39:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) Word has length 326 [2022-01-10 06:39:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:36,066 INFO L225 Difference]: With dead ends: 147 [2022-01-10 06:39:36,066 INFO L226 Difference]: Without dead ends: 143 [2022-01-10 06:39:36,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:39:36,067 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:36,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 196 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-10 06:39:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2022-01-10 06:39:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 78 states have internal predecessors, (84), 23 states have call successors, (23), 10 states have call predecessors, (23), 25 states have return successors, (118), 39 states have call predecessors, (118), 23 states have call successors, (118) [2022-01-10 06:39:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 225 transitions. [2022-01-10 06:39:36,093 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 225 transitions. Word has length 326 [2022-01-10 06:39:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:36,094 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 225 transitions. [2022-01-10 06:39:36,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 11 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) [2022-01-10 06:39:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 225 transitions. [2022-01-10 06:39:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2022-01-10 06:39:36,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:36,097 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:36,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:36,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:36,305 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:36,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1126446074, now seen corresponding path program 13 times [2022-01-10 06:39:36,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:36,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156367260] [2022-01-10 06:39:36,306 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 06:39:36,306 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:36,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:36,307 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:36,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 06:39:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:36,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:39:36,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4806 backedges. 367 proven. 463 refuted. 0 times theorem prover too weak. 3976 trivial. 0 not checked. [2022-01-10 06:39:36,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4806 backedges. 367 proven. 479 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2022-01-10 06:39:38,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:38,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156367260] [2022-01-10 06:39:38,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156367260] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:38,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:38,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2022-01-10 06:39:38,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809457124] [2022-01-10 06:39:38,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:38,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:39:38,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:39:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-01-10 06:39:38,092 INFO L87 Difference]: Start difference. First operand 128 states and 225 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 14 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 9 states have call predecessors, (22), 14 states have call successors, (22) [2022-01-10 06:39:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:38,333 INFO L93 Difference]: Finished difference Result 277 states and 630 transitions. [2022-01-10 06:39:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:39:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 14 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 9 states have call predecessors, (22), 14 states have call successors, (22) Word has length 389 [2022-01-10 06:39:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:38,336 INFO L225 Difference]: With dead ends: 277 [2022-01-10 06:39:38,336 INFO L226 Difference]: Without dead ends: 152 [2022-01-10 06:39:38,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 758 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-01-10 06:39:38,337 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:38,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 214 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-01-10 06:39:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2022-01-10 06:39:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 82 states have internal predecessors, (88), 25 states have call successors, (25), 10 states have call predecessors, (25), 27 states have return successors, (144), 43 states have call predecessors, (144), 25 states have call successors, (144) [2022-01-10 06:39:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 257 transitions. [2022-01-10 06:39:38,346 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 257 transitions. Word has length 389 [2022-01-10 06:39:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:38,347 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 257 transitions. [2022-01-10 06:39:38,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 14 states have call successors, (19), 1 states have call predecessors, (19), 7 states have return successors, (22), 9 states have call predecessors, (22), 14 states have call successors, (22) [2022-01-10 06:39:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 257 transitions. [2022-01-10 06:39:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2022-01-10 06:39:38,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:38,350 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 38, 38, 32, 32, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 13, 12, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:38,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:38,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:38,559 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1948530121, now seen corresponding path program 14 times [2022-01-10 06:39:38,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:38,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959463801] [2022-01-10 06:39:38,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:38,560 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:38,561 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:38,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 06:39:38,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:38,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:38,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:39:38,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8167 backedges. 534 proven. 796 refuted. 0 times theorem prover too weak. 6837 trivial. 0 not checked. [2022-01-10 06:39:39,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8167 backedges. 534 proven. 820 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2022-01-10 06:39:41,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:41,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959463801] [2022-01-10 06:39:41,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959463801] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:41,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:41,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 19 [2022-01-10 06:39:41,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93238344] [2022-01-10 06:39:41,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:41,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:39:41,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:41,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:39:41,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-01-10 06:39:41,297 INFO L87 Difference]: Start difference. First operand 136 states and 257 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 06:39:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:41,727 INFO L93 Difference]: Finished difference Result 239 states and 511 transitions. [2022-01-10 06:39:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 06:39:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) Word has length 503 [2022-01-10 06:39:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:41,732 INFO L225 Difference]: With dead ends: 239 [2022-01-10 06:39:41,733 INFO L226 Difference]: Without dead ends: 182 [2022-01-10 06:39:41,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 981 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 06:39:41,734 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 85 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:41,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 173 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-10 06:39:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2022-01-10 06:39:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 98 states have (on average 1.0714285714285714) internal successors, (105), 96 states have internal predecessors, (105), 29 states have call successors, (29), 15 states have call predecessors, (29), 27 states have return successors, (166), 43 states have call predecessors, (166), 29 states have call successors, (166) [2022-01-10 06:39:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 300 transitions. [2022-01-10 06:39:41,744 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 300 transitions. Word has length 503 [2022-01-10 06:39:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:41,744 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 300 transitions. [2022-01-10 06:39:41,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 06:39:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 300 transitions. [2022-01-10 06:39:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2022-01-10 06:39:41,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:41,747 INFO L514 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:41,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:41,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:41,957 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1544554768, now seen corresponding path program 15 times [2022-01-10 06:39:41,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471130914] [2022-01-10 06:39:41,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:41,958 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:41,959 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:41,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 06:39:42,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-01-10 06:39:42,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:39:42,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7732 backedges. 1072 proven. 135 refuted. 0 times theorem prover too weak. 6525 trivial. 0 not checked. [2022-01-10 06:39:42,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7732 backedges. 1077 proven. 145 refuted. 0 times theorem prover too weak. 6510 trivial. 0 not checked. [2022-01-10 06:39:44,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:44,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471130914] [2022-01-10 06:39:44,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471130914] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:44,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:44,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 17 [2022-01-10 06:39:44,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991738899] [2022-01-10 06:39:44,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:44,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 06:39:44,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:44,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 06:39:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:39:44,212 INFO L87 Difference]: Start difference. First operand 155 states and 300 transitions. Second operand has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 10 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 14 states have call predecessors, (24), 10 states have call successors, (24) [2022-01-10 06:39:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:44,533 INFO L93 Difference]: Finished difference Result 346 states and 948 transitions. [2022-01-10 06:39:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 06:39:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 10 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 14 states have call predecessors, (24), 10 states have call successors, (24) Word has length 490 [2022-01-10 06:39:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:44,536 INFO L225 Difference]: With dead ends: 346 [2022-01-10 06:39:44,536 INFO L226 Difference]: Without dead ends: 212 [2022-01-10 06:39:44,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 962 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-01-10 06:39:44,538 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:44,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 203 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-10 06:39:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 187. [2022-01-10 06:39:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 115 states have (on average 1.0608695652173914) internal successors, (122), 113 states have internal predecessors, (122), 37 states have call successors, (37), 16 states have call predecessors, (37), 34 states have return successors, (246), 57 states have call predecessors, (246), 37 states have call successors, (246) [2022-01-10 06:39:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 405 transitions. [2022-01-10 06:39:44,550 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 405 transitions. Word has length 490 [2022-01-10 06:39:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:44,550 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 405 transitions. [2022-01-10 06:39:44,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 10 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (24), 14 states have call predecessors, (24), 10 states have call successors, (24) [2022-01-10 06:39:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 405 transitions. [2022-01-10 06:39:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2022-01-10 06:39:44,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:44,553 INFO L514 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 26, 26, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 10, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:44,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:44,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:44,762 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:44,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash -370290986, now seen corresponding path program 16 times [2022-01-10 06:39:44,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:44,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914752844] [2022-01-10 06:39:44,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:39:44,763 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:44,765 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:44,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-01-10 06:39:44,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:39:44,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:39:45,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5466 backedges. 791 proven. 275 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2022-01-10 06:39:45,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5466 backedges. 791 proven. 299 refuted. 0 times theorem prover too weak. 4376 trivial. 0 not checked. [2022-01-10 06:39:47,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914752844] [2022-01-10 06:39:47,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914752844] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:47,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:47,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 19 [2022-01-10 06:39:47,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100751139] [2022-01-10 06:39:47,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:47,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:39:47,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:39:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-01-10 06:39:47,106 INFO L87 Difference]: Start difference. First operand 187 states and 405 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 06:39:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:47,454 INFO L93 Difference]: Finished difference Result 203 states and 435 transitions. [2022-01-10 06:39:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 06:39:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) Word has length 414 [2022-01-10 06:39:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:47,456 INFO L225 Difference]: With dead ends: 203 [2022-01-10 06:39:47,456 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 06:39:47,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 803 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 06:39:47,457 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:47,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 06:39:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2022-01-10 06:39:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 107 states have (on average 1.0654205607476634) internal successors, (114), 105 states have internal predecessors, (114), 36 states have call successors, (36), 16 states have call predecessors, (36), 30 states have return successors, (189), 52 states have call predecessors, (189), 36 states have call successors, (189) [2022-01-10 06:39:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 339 transitions. [2022-01-10 06:39:47,469 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 339 transitions. Word has length 414 [2022-01-10 06:39:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:47,469 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 339 transitions. [2022-01-10 06:39:47,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 19 states have internal predecessors, (61), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 11 states have call predecessors, (26), 16 states have call successors, (26) [2022-01-10 06:39:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 339 transitions. [2022-01-10 06:39:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-01-10 06:39:47,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:47,472 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:47,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:47,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:47,679 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash -379544600, now seen corresponding path program 17 times [2022-01-10 06:39:47,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545677984] [2022-01-10 06:39:47,680 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:39:47,680 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:47,681 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:47,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-01-10 06:39:48,078 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-01-10 06:39:48,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:39:48,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:39:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:39:48,418 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:39:48,418 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:39:48,418 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:39:48,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:48,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:48,634 INFO L732 BasicCegarLoop]: Path program histogram: [17, 3, 3, 2, 1, 1, 1, 1] [2022-01-10 06:39:48,637 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:39:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:39:48 BoogieIcfgContainer [2022-01-10 06:39:48,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:39:48,700 INFO L158 Benchmark]: Toolchain (without parser) took 52600.53ms. Allocated memory was 199.2MB in the beginning and 493.9MB in the end (delta: 294.6MB). Free memory was 145.2MB in the beginning and 183.6MB in the end (delta: -38.3MB). Peak memory consumption was 256.5MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,700 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:39:48,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.76ms. Allocated memory was 199.2MB in the beginning and 284.2MB in the end (delta: 84.9MB). Free memory was 145.0MB in the beginning and 256.2MB in the end (delta: -111.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.35ms. Allocated memory is still 284.2MB. Free memory was 256.2MB in the beginning and 255.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,701 INFO L158 Benchmark]: Boogie Preprocessor took 24.79ms. Allocated memory is still 284.2MB. Free memory was 255.2MB in the beginning and 254.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,701 INFO L158 Benchmark]: RCFGBuilder took 225.53ms. Allocated memory is still 284.2MB. Free memory was 254.2MB in the beginning and 243.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,701 INFO L158 Benchmark]: TraceAbstraction took 52105.08ms. Allocated memory was 284.2MB in the beginning and 493.9MB in the end (delta: 209.7MB). Free memory was 242.6MB in the beginning and 183.6MB in the end (delta: 59.1MB). Peak memory consumption was 268.8MB. Max. memory is 8.0GB. [2022-01-10 06:39:48,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.76ms. Allocated memory was 199.2MB in the beginning and 284.2MB in the end (delta: 84.9MB). Free memory was 145.0MB in the beginning and 256.2MB in the end (delta: -111.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.35ms. Allocated memory is still 284.2MB. Free memory was 256.2MB in the beginning and 255.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.79ms. Allocated memory is still 284.2MB. Free memory was 255.2MB in the beginning and 254.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 225.53ms. Allocated memory is still 284.2MB. Free memory was 254.2MB in the beginning and 243.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 52105.08ms. Allocated memory was 284.2MB in the beginning and 493.9MB in the end (delta: 209.7MB). Free memory was 242.6MB in the beginning and 183.6MB in the end (delta: 59.1MB). Peak memory consumption was 268.8MB. 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.0s, OverallIterations: 29, TraceHistogramMax: 57, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1068 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 4854 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4173 mSDsCounter, 981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7076 IncrementalHoareTripleChecker+Invalid, 8057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 981 mSolverCounterUnsat, 681 mSDtfsCounter, 7076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12785 GetRequests, 12242 SyntacticMatches, 22 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=20, InterpolantAutomatonStates: 345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 582 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 7163 NumberOfCodeBlocks, 4858 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 12573 ConstructedInterpolants, 0 QuantifiedInterpolants, 18870 SizeOfPredicates, 130 NumberOfNonLiveVariables, 6506 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 52 InterpolantComputations, 4 PerfectInterpolantSequences, 154841/167538 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! [2022-01-10 06:39:48,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...