./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 13:19:24,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 13:19:24,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 13:19:24,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 13:19:24,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 13:19:24,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 13:19:24,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 13:19:24,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 13:19:24,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 13:19:24,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 13:19:24,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 13:19:24,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 13:19:24,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 13:19:24,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 13:19:24,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 13:19:24,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 13:19:24,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 13:19:24,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 13:19:24,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 13:19:24,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 13:19:24,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 13:19:24,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 13:19:24,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 13:19:24,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 13:19:24,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 13:19:24,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 13:19:24,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 13:19:24,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 13:19:24,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 13:19:24,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 13:19:24,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 13:19:24,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 13:19:24,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 13:19:24,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 13:19:24,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 13:19:24,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 13:19:24,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 13:19:24,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 13:19:24,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 13:19:24,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 13:19:24,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 13:19:24,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 13:19:24,589 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 13:19:24,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 13:19:24,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 13:19:24,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 13:19:24,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 13:19:24,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 13:19:24,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 13:19:24,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 13:19:24,591 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 13:19:24,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 13:19:24,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 13:19:24,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 13:19:24,593 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 13:19:24,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 13:19:24,593 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 13:19:24,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 13:19:24,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 13:19:24,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 13:19:24,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 13:19:24,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:19:24,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 13:19:24,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 13:19:24,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 13:19:24,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 13:19:24,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2021-12-21 13:19:24,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 13:19:24,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 13:19:24,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 13:19:24,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 13:19:24,837 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 13:19:24,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-21 13:19:24,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0c4c01b/42d415a52a0d4a9a9d76260ebbe4a39e/FLAG4c76b9370 [2021-12-21 13:19:25,278 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 13:19:25,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-21 13:19:25,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0c4c01b/42d415a52a0d4a9a9d76260ebbe4a39e/FLAG4c76b9370 [2021-12-21 13:19:25,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0c4c01b/42d415a52a0d4a9a9d76260ebbe4a39e [2021-12-21 13:19:25,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 13:19:25,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 13:19:25,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 13:19:25,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 13:19:25,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 13:19:25,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41758141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25, skipping insertion in model container [2021-12-21 13:19:25,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 13:19:25,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 13:19:25,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-21 13:19:25,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:19:25,461 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 13:19:25,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-21 13:19:25,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:19:25,482 INFO L208 MainTranslator]: Completed translation [2021-12-21 13:19:25,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25 WrapperNode [2021-12-21 13:19:25,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 13:19:25,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 13:19:25,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 13:19:25,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 13:19:25,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,501 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-21 13:19:25,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 13:19:25,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 13:19:25,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 13:19:25,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 13:19:25,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 13:19:25,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 13:19:25,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 13:19:25,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 13:19:25,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (1/1) ... [2021-12-21 13:19:25,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:19:25,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:25,546 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) [2021-12-21 13:19:25,571 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 [2021-12-21 13:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 13:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 13:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-21 13:19:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-21 13:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-21 13:19:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-21 13:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 13:19:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 13:19:25,612 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 13:19:25,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 13:19:25,684 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 13:19:25,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 13:19:25,688 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 13:19:25,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:25 BoogieIcfgContainer [2021-12-21 13:19:25,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 13:19:25,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 13:19:25,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 13:19:25,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 13:19:25,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:19:25" (1/3) ... [2021-12-21 13:19:25,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35923561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:19:25, skipping insertion in model container [2021-12-21 13:19:25,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:25" (2/3) ... [2021-12-21 13:19:25,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35923561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:19:25, skipping insertion in model container [2021-12-21 13:19:25,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:25" (3/3) ... [2021-12-21 13:19:25,696 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2021-12-21 13:19:25,699 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 13:19:25,699 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 13:19:25,726 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 13:19:25,731 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 [2021-12-21 13:19:25,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 13:19:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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) [2021-12-21 13:19:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 13:19:25,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:25,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:25,745 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-21 13:19:25,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579175399] [2021-12-21 13:19:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:25,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:19:25,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579175399] [2021-12-21 13:19:25,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579175399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:19:25,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:19:25,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:19:25,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742702764] [2021-12-21 13:19:25,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:19:25,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:19:25,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:25,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:19:25,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:25,982 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-12-21 13:19:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:26,025 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-21 13:19:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:19:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2021-12-21 13:19:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:26,032 INFO L225 Difference]: With dead ends: 43 [2021-12-21 13:19:26,033 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 13:19:26,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:26,039 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:26,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:19:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 13:19:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-21 13:19:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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) [2021-12-21 13:19:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-21 13:19:26,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-21 13:19:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:26,077 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-21 13:19:26,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-12-21 13:19:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-21 13:19:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 13:19:26,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:26,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:26,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 13:19:26,081 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-21 13:19:26,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982213819] [2021-12-21 13:19:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:26,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:19:26,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:26,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982213819] [2021-12-21 13:19:26,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982213819] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:19:26,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:19:26,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:19:26,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027982915] [2021-12-21 13:19:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:19:26,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:19:26,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:19:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:26,181 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2021-12-21 13:19:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:26,201 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-21 13:19:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:19:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 [2021-12-21 13:19:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:26,204 INFO L225 Difference]: With dead ends: 33 [2021-12-21 13:19:26,204 INFO L226 Difference]: Without dead ends: 29 [2021-12-21 13:19:26,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:26,206 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:26,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:19:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-21 13:19:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-21 13:19:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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) [2021-12-21 13:19:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-21 13:19:26,217 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-21 13:19:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:26,218 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-21 13:19:26,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2021-12-21 13:19:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-21 13:19:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 13:19:26,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:26,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:26,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 13:19:26,221 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-21 13:19:26,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299774639] [2021-12-21 13:19:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:26,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:19:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:26,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:26,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299774639] [2021-12-21 13:19:26,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299774639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77105737] [2021-12-21 13:19:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:26,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:26,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:26,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 13:19:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:26,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:19:26,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:26,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:26,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77105737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:26,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:26,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-21 13:19:26,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584289359] [2021-12-21 13:19:26,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:26,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 13:19:26,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 13:19:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 13:19:26,658 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 13:19:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:26,823 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-21 13:19:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 13:19:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-12-21 13:19:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:26,826 INFO L225 Difference]: With dead ends: 55 [2021-12-21 13:19:26,826 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 13:19:26,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-21 13:19:26,829 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:26,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 13:19:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-21 13:19:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-21 13:19:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-21 13:19:26,840 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-21 13:19:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:26,840 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-21 13:19:26,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 13:19:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-21 13:19:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 13:19:26,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:26,844 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, 1] [2021-12-21 13:19:26,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:27,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:27,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-21 13:19:27,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387282257] [2021-12-21 13:19:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:27,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:27,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387282257] [2021-12-21 13:19:27,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387282257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877276317] [2021-12-21 13:19:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:27,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:27,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 13:19:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:19:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:27,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:27,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877276317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:27,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:27,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-21 13:19:27,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513488888] [2021-12-21 13:19:27,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:27,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 13:19:27,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 13:19:27,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 13:19:27,464 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 13:19:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:27,575 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-21 13:19:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 13:19:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-12-21 13:19:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:27,580 INFO L225 Difference]: With dead ends: 51 [2021-12-21 13:19:27,580 INFO L226 Difference]: Without dead ends: 47 [2021-12-21 13:19:27,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-21 13:19:27,582 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:27,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-21 13:19:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-21 13:19:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-21 13:19:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-21 13:19:27,599 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-21 13:19:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:27,600 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-21 13:19:27,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 13:19:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-21 13:19:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 13:19:27,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:27,601 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, 1] [2021-12-21 13:19:27,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:27,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 13:19:27,808 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-21 13:19:27,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105334634] [2021-12-21 13:19:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:27,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:19:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 13:19:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 13:19:27,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:27,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105334634] [2021-12-21 13:19:27,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105334634] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:27,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969774776] [2021-12-21 13:19:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:27,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:27,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:27,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:27,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 13:19:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:19:28,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 13:19:28,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:19:28,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969774776] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:28,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:28,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-21 13:19:28,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871775859] [2021-12-21 13:19:28,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:28,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 13:19:28,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:28,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 13:19:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-21 13:19:28,411 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:28,603 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-21 13:19:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 13:19:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-21 13:19:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:28,605 INFO L225 Difference]: With dead ends: 105 [2021-12-21 13:19:28,605 INFO L226 Difference]: Without dead ends: 63 [2021-12-21 13:19:28,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-21 13:19:28,607 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:28,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-21 13:19:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-21 13:19:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-21 13:19:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-21 13:19:28,618 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-21 13:19:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:28,619 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-21 13:19:28,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-21 13:19:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 13:19:28,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:28,621 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, 1, 1] [2021-12-21 13:19:28,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 13:19:28,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:28,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-21 13:19:28,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:28,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800620493] [2021-12-21 13:19:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:28,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 13:19:28,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:28,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800620493] [2021-12-21 13:19:28,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800620493] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:28,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802128700] [2021-12-21 13:19:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:28,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:28,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:28,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 13:19:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:29,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:19:29,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 13:19:29,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:19:29,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802128700] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:29,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:29,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-21 13:19:29,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366538251] [2021-12-21 13:19:29,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:29,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 13:19:29,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 13:19:29,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-21 13:19:29,363 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:29,639 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-21 13:19:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 13:19:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-21 13:19:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:29,642 INFO L225 Difference]: With dead ends: 177 [2021-12-21 13:19:29,642 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 13:19:29,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-21 13:19:29,644 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:29,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 13:19:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-21 13:19:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-21 13:19:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-21 13:19:29,657 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-21 13:19:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:29,657 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-21 13:19:29,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-21 13:19:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 13:19:29,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:29,660 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2021-12-21 13:19:29,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:29,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:29,878 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-21 13:19:29,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960321432] [2021-12-21 13:19:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:29,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 13:19:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 13:19:30,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:30,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960321432] [2021-12-21 13:19:30,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960321432] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:30,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092159804] [2021-12-21 13:19:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:30,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:30,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:30,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 13:19:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 13:19:30,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 13:19:30,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 13:19:30,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092159804] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:30,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:30,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-21 13:19:30,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955863871] [2021-12-21 13:19:30,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:30,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 13:19:30,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 13:19:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-21 13:19:30,631 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-21 13:19:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:30,977 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-21 13:19:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 13:19:30,978 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), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-21 13:19:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:30,980 INFO L225 Difference]: With dead ends: 255 [2021-12-21 13:19:30,980 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 13:19:30,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-21 13:19:30,981 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:30,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 13:19:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-21 13:19:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-21 13:19:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-21 13:19:31,009 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-21 13:19:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:31,009 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-21 13:19:31,010 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), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-21 13:19:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-21 13:19:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-21 13:19:31,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:31,024 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:31,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 13:19:31,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:31,242 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-21 13:19:31,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:31,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639337853] [2021-12-21 13:19:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:31,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:19:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-21 13:19:31,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639337853] [2021-12-21 13:19:31,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639337853] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576417799] [2021-12-21 13:19:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:31,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:31,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:31,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 13:19:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 13:19:31,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-21 13:19:31,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-21 13:19:32,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576417799] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:32,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:32,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-12-21 13:19:32,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087017020] [2021-12-21 13:19:32,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:32,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 13:19:32,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 13:19:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-12-21 13:19:32,259 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-21 13:19:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:32,620 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-21 13:19:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 13:19:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) Word has length 93 [2021-12-21 13:19:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:32,622 INFO L225 Difference]: With dead ends: 240 [2021-12-21 13:19:32,622 INFO L226 Difference]: Without dead ends: 107 [2021-12-21 13:19:32,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 13:19:32,624 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:32,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 237 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-21 13:19:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-21 13:19:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-21 13:19:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-21 13:19:32,631 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-21 13:19:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:32,632 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-21 13:19:32,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-21 13:19:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-21 13:19:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-21 13:19:32,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:32,634 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:32,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:32,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:32,848 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-21 13:19:32,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:32,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016523041] [2021-12-21 13:19:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:32,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:19:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:19:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-21 13:19:33,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:33,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016523041] [2021-12-21 13:19:33,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016523041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:33,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809970473] [2021-12-21 13:19:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:33,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:33,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:33,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:33,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 13:19:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 13:19:33,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 121 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-12-21 13:19:33,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 126 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-12-21 13:19:34,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809970473] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:34,048 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:34,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2021-12-21 13:19:34,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764749468] [2021-12-21 13:19:34,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:34,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 13:19:34,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 13:19:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-21 13:19:34,050 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-21 13:19:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:34,334 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-21 13:19:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-21 13:19:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-21 13:19:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:34,336 INFO L225 Difference]: With dead ends: 169 [2021-12-21 13:19:34,336 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 13:19:34,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2021-12-21 13:19:34,337 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:34,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 270 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 13:19:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-12-21 13:19:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (35), 18 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-21 13:19:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2021-12-21 13:19:34,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 148 [2021-12-21 13:19:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:34,344 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2021-12-21 13:19:34,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-21 13:19:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2021-12-21 13:19:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-21 13:19:34,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:34,345 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:34,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:34,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:34,552 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:34,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2043735506, now seen corresponding path program 2 times [2021-12-21 13:19:34,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:34,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118192042] [2021-12-21 13:19:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:34,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 13:19:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-21 13:19:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 112 proven. 115 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-12-21 13:19:34,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:34,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118192042] [2021-12-21 13:19:34,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118192042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:34,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099308326] [2021-12-21 13:19:34,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 13:19:34,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:34,763 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:34,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 13:19:34,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 13:19:34,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:34,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 13:19:34,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 101 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-12-21 13:19:35,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 106 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-21 13:19:35,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099308326] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:35,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:35,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 21 [2021-12-21 13:19:35,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465486764] [2021-12-21 13:19:35,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:35,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 13:19:35,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:35,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 13:19:35,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-12-21 13:19:35,694 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-21 13:19:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:35,914 INFO L93 Difference]: Finished difference Result 184 states and 267 transitions. [2021-12-21 13:19:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-21 13:19:35,916 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-21 13:19:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:35,918 INFO L225 Difference]: With dead ends: 184 [2021-12-21 13:19:35,918 INFO L226 Difference]: Without dead ends: 107 [2021-12-21 13:19:35,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-12-21 13:19:35,919 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:35,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 268 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-21 13:19:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-12-21 13:19:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (33), 18 states have call predecessors, (33), 14 states have call successors, (33) [2021-12-21 13:19:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2021-12-21 13:19:35,924 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 148 [2021-12-21 13:19:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:35,925 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2021-12-21 13:19:35,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-21 13:19:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2021-12-21 13:19:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-21 13:19:35,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:35,926 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:35,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-21 13:19:36,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 13:19:36,155 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -552714558, now seen corresponding path program 3 times [2021-12-21 13:19:36,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018245983] [2021-12-21 13:19:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:36,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-21 13:19:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 207 proven. 121 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2021-12-21 13:19:36,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:36,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018245983] [2021-12-21 13:19:36,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018245983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:36,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906172254] [2021-12-21 13:19:36,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 13:19:36,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:36,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:36,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 13:19:36,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 13:19:36,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:36,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:19:36,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 32 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2021-12-21 13:19:36,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 34 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2021-12-21 13:19:37,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906172254] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:37,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:37,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 24 [2021-12-21 13:19:37,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478529937] [2021-12-21 13:19:37,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:37,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 13:19:37,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 13:19:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-12-21 13:19:37,143 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-21 13:19:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:37,423 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-12-21 13:19:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 13:19:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) Word has length 174 [2021-12-21 13:19:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:37,424 INFO L225 Difference]: With dead ends: 187 [2021-12-21 13:19:37,424 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 13:19:37,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 13:19:37,425 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:37,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 276 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 13:19:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2021-12-21 13:19:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2021-12-21 13:19:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2021-12-21 13:19:37,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 174 [2021-12-21 13:19:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:37,430 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2021-12-21 13:19:37,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-21 13:19:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2021-12-21 13:19:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-21 13:19:37,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:37,433 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:37,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:37,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:37,633 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash -712391191, now seen corresponding path program 4 times [2021-12-21 13:19:37,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:37,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213769566] [2021-12-21 13:19:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:37,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 13:19:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:19:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 13:19:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 194 proven. 345 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-12-21 13:19:38,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:38,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213769566] [2021-12-21 13:19:38,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213769566] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:38,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211930087] [2021-12-21 13:19:38,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 13:19:38,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:38,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:38,075 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:38,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 13:19:38,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 13:19:38,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:38,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 13:19:38,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 97 proven. 261 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2021-12-21 13:19:38,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 101 proven. 265 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2021-12-21 13:19:39,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211930087] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:39,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:39,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 13] total 33 [2021-12-21 13:19:39,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246899397] [2021-12-21 13:19:39,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:39,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 13:19:39,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 13:19:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 13:19:39,421 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-21 13:19:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:40,136 INFO L93 Difference]: Finished difference Result 250 states and 417 transitions. [2021-12-21 13:19:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-21 13:19:40,137 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) Word has length 217 [2021-12-21 13:19:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:40,138 INFO L225 Difference]: With dead ends: 250 [2021-12-21 13:19:40,138 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 13:19:40,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2021-12-21 13:19:40,141 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 159 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:40,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 520 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 13:19:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 13:19:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2021-12-21 13:19:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 83 states have internal predecessors, (96), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-21 13:19:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2021-12-21 13:19:40,150 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 217 [2021-12-21 13:19:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:40,150 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2021-12-21 13:19:40,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-21 13:19:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2021-12-21 13:19:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-21 13:19:40,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:40,152 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:40,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:40,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 13:19:40,370 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 521886258, now seen corresponding path program 5 times [2021-12-21 13:19:40,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602910880] [2021-12-21 13:19:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:40,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:19:40,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 13:19:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:19:40,434 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 13:19:40,435 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 13:19:40,435 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 13:19:40,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 13:19:40,439 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:40,441 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 13:19:40,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:19:40 BoogieIcfgContainer [2021-12-21 13:19:40,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 13:19:40,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 13:19:40,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 13:19:40,474 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 13:19:40,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:25" (3/4) ... [2021-12-21 13:19:40,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 13:19:40,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 13:19:40,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 13:19:40,519 INFO L158 Benchmark]: Toolchain (without parser) took 15220.37ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 80.3MB in the beginning and 178.9MB in the end (delta: -98.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,520 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:19:40,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.82ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 83.5MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.30ms. Allocated memory is still 107.0MB. Free memory was 83.5MB in the beginning and 82.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,520 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 81.2MB in the end (delta: 921.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:19:40,521 INFO L158 Benchmark]: RCFGBuilder took 164.41ms. Allocated memory is still 107.0MB. Free memory was 81.2MB in the beginning and 72.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,521 INFO L158 Benchmark]: TraceAbstraction took 14782.70ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 71.6MB in the beginning and 184.1MB in the end (delta: -112.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,521 INFO L158 Benchmark]: Witness Printer took 45.53ms. Allocated memory is still 226.5MB. Free memory was 184.1MB in the beginning and 178.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 13:19:40,523 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.17ms. Allocated memory is still 107.0MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.82ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 83.5MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.30ms. Allocated memory is still 107.0MB. Free memory was 83.5MB in the beginning and 82.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 81.2MB in the end (delta: 921.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 164.41ms. Allocated memory is still 107.0MB. Free memory was 81.2MB in the beginning and 72.2MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14782.70ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 71.6MB in the beginning and 184.1MB in the end (delta: -112.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 45.53ms. Allocated memory is still 226.5MB. Free memory was 184.1MB in the beginning and 178.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) 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); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] reach_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 2757 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2402 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4154 IncrementalHoareTripleChecker+Invalid, 5090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 355 mSDtfsCounter, 4154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2390 GetRequests, 2093 SyntacticMatches, 17 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=12, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 142 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2097 NumberOfCodeBlocks, 1942 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2842 ConstructedInterpolants, 0 QuantifiedInterpolants, 5001 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1959 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 8275/10407 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! [2021-12-21 13:19:40,568 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE