./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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_8-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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 01:00:40,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:00:40,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:00:40,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:00:40,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:00:40,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:00:40,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:00:40,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:00:40,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:00:40,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:00:40,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:00:40,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:00:40,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:00:40,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:00:40,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:00:40,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:00:40,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:00:40,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:00:40,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:00:40,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:00:40,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:00:40,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:00:40,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:00:40,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:00:40,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:00:40,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:00:40,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:00:40,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:00:40,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:00:40,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:00:40,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:00:40,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:00:40,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:00:40,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:00:40,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:00:40,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:00:40,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:00:40,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:00:40,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:00:40,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:00:40,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:00:40,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:00:40,711 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:00:40,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:00:40,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:00:40,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:00:40,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:00:40,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:00:40,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:00:40,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:00:40,714 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:00:40,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:00:40,715 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:00:40,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:00:40,717 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:00:40,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:00:40,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:00:40,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:00:40,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:00:40,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:00:40,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:00:40,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:00:40,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:00:40,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:00:40,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:00:40,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:00:40,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:00:40,719 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:00:40,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:00:40,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:00:40,720 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2021-12-28 01:00:41,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:00:41,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:00:41,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:00:41,037 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:00:41,039 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:00:41,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-28 01:00:41,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121acd096/e2fce68a6462401a8965e5d9592cab88/FLAGfdb6c0120 [2021-12-28 01:00:41,498 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:00:41,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-28 01:00:41,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121acd096/e2fce68a6462401a8965e5d9592cab88/FLAGfdb6c0120 [2021-12-28 01:00:41,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121acd096/e2fce68a6462401a8965e5d9592cab88 [2021-12-28 01:00:41,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:00:41,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:00:41,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:00:41,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:00:41,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:00:41,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c28f66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41, skipping insertion in model container [2021-12-28 01:00:41,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:00:41,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:00:41,672 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_8-2.c[947,960] [2021-12-28 01:00:41,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:00:41,683 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:00:41,697 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_8-2.c[947,960] [2021-12-28 01:00:41,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:00:41,727 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:00:41,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41 WrapperNode [2021-12-28 01:00:41,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:00:41,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:00:41,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:00:41,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:00:41,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,767 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-28 01:00:41,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:00:41,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:00:41,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:00:41,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:00:41,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:00:41,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:00:41,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:00:41,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:00:41,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (1/1) ... [2021-12-28 01:00:41,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:00:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:41,840 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-28 01:00:41,865 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-28 01:00:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:00:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:00:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-28 01:00:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-28 01:00:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-28 01:00:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-28 01:00:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:00:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:00:41,941 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:00:41,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:00:42,091 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:00:42,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:00:42,099 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 01:00:42,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:00:42 BoogieIcfgContainer [2021-12-28 01:00:42,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:00:42,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:00:42,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:00:42,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:00:42,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:00:41" (1/3) ... [2021-12-28 01:00:42,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4361dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:00:42, skipping insertion in model container [2021-12-28 01:00:42,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:00:41" (2/3) ... [2021-12-28 01:00:42,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4361dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:00:42, skipping insertion in model container [2021-12-28 01:00:42,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:00:42" (3/3) ... [2021-12-28 01:00:42,110 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-12-28 01:00:42,114 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:00:42,115 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:00:42,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:00:42,186 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-28 01:00:42,187 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:00:42,205 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-28 01:00:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 01:00:42,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:42,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:00:42,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-28 01:00:42,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:42,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020764733] [2021-12-28 01:00:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:42,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,517 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-28 01:00:42,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:42,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020764733] [2021-12-28 01:00:42,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020764733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:00:42,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:00:42,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:00:42,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203345291] [2021-12-28 01:00:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:00:42,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:00:42,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:00:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:00:42,559 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-28 01:00:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:42,621 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-28 01:00:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:00:42,624 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-28 01:00:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:42,630 INFO L225 Difference]: With dead ends: 43 [2021-12-28 01:00:42,630 INFO L226 Difference]: Without dead ends: 27 [2021-12-28 01:00:42,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:00:42,639 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-28 01:00:42,640 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-28 01:00:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-28 01:00:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-28 01:00:42,697 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-28 01:00:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-28 01:00:42,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-28 01:00:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:42,701 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-28 01:00:42,702 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-28 01:00:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-28 01:00:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 01:00:42,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:42,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:00:42,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:00:42,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-28 01:00:42,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:42,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105481290] [2021-12-28 01:00:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:42,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,809 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-28 01:00:42,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:42,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105481290] [2021-12-28 01:00:42,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105481290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:00:42,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:00:42,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 01:00:42,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840090957] [2021-12-28 01:00:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:00:42,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:00:42,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:42,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:00:42,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 01:00:42,815 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-28 01:00:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:42,841 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-28 01:00:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:00:42,842 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-28 01:00:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:42,845 INFO L225 Difference]: With dead ends: 33 [2021-12-28 01:00:42,845 INFO L226 Difference]: Without dead ends: 29 [2021-12-28 01:00:42,849 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-28 01:00:42,851 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-28 01:00:42,851 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-28 01:00:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-28 01:00:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-28 01:00:42,861 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-28 01:00:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-28 01:00:42,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-28 01:00:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:42,870 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-28 01:00:42,870 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-28 01:00:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-28 01:00:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 01:00:42,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:42,871 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-28 01:00:42,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:00:42,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-28 01:00:42,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:42,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240234278] [2021-12-28 01:00:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:42,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 01:00:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,956 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-28 01:00:42,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240234278] [2021-12-28 01:00:42,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240234278] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:42,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100521920] [2021-12-28 01:00:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:42,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:42,959 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-28 01:00:42,960 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-28 01:00:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:42,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:00:43,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:43,156 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-28 01:00:43,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:43,389 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-28 01:00:43,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100521920] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:43,389 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:43,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-28 01:00:43,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347169732] [2021-12-28 01:00:43,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:43,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 01:00:43,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 01:00:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:00:43,396 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-28 01:00:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:43,560 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-28 01:00:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:00:43,561 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-28 01:00:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:43,564 INFO L225 Difference]: With dead ends: 55 [2021-12-28 01:00:43,564 INFO L226 Difference]: Without dead ends: 31 [2021-12-28 01:00:43,566 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-28 01:00:43,569 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-28 01:00:43,570 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-28 01:00:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-28 01:00:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-28 01:00:43,581 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-28 01:00:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-28 01:00:43,583 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-28 01:00:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:43,583 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-28 01:00:43,584 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-28 01:00:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-28 01:00:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 01:00:43,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:43,588 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-28 01:00:43,617 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-28 01:00:43,803 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-28 01:00:43,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-28 01:00:43,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:43,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899528897] [2021-12-28 01:00:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:43,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:43,903 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-28 01:00:43,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:43,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899528897] [2021-12-28 01:00:43,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899528897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:43,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493422946] [2021-12-28 01:00:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:43,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:43,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:43,906 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-28 01:00:43,910 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-28 01:00:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:43,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:00:43,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:44,027 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-28 01:00:44,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:44,229 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-28 01:00:44,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493422946] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:44,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:44,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-28 01:00:44,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602230977] [2021-12-28 01:00:44,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:44,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 01:00:44,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 01:00:44,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:00:44,234 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-28 01:00:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:44,383 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-28 01:00:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 01:00:44,383 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-28 01:00:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:44,385 INFO L225 Difference]: With dead ends: 51 [2021-12-28 01:00:44,386 INFO L226 Difference]: Without dead ends: 47 [2021-12-28 01:00:44,386 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-28 01:00:44,387 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-28 01:00:44,392 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-28 01:00:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-28 01:00:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-28 01:00:44,402 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-28 01:00:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-28 01:00:44,403 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-28 01:00:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:44,404 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-28 01:00:44,404 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-28 01:00:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-28 01:00:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 01:00:44,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:44,406 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-28 01:00:44,440 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-28 01:00:44,627 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-28 01:00:44,628 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-28 01:00:44,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192182096] [2021-12-28 01:00:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:44,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 01:00:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:00:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,746 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-28 01:00:44,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:44,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192182096] [2021-12-28 01:00:44,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192182096] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:44,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375025759] [2021-12-28 01:00:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:44,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:44,748 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-28 01:00:44,755 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-28 01:00:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:44,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 01:00:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:44,924 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-28 01:00:44,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:45,296 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-28 01:00:45,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375025759] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:45,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:45,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-28 01:00:45,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300697872] [2021-12-28 01:00:45,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:45,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 01:00:45,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 01:00:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-28 01:00:45,301 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-28 01:00:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:45,509 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-28 01:00:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 01:00:45,510 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-28 01:00:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:45,517 INFO L225 Difference]: With dead ends: 105 [2021-12-28 01:00:45,517 INFO L226 Difference]: Without dead ends: 63 [2021-12-28 01:00:45,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-28 01:00:45,523 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-28 01:00:45,524 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-28 01:00:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-28 01:00:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-28 01:00:45,542 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-28 01:00:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-28 01:00:45,552 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-28 01:00:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:45,553 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-28 01:00:45,553 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-28 01:00:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-28 01:00:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 01:00:45,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:45,554 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-28 01:00:45,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 01:00:45,755 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-28 01:00:45,756 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-28 01:00:45,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264367101] [2021-12-28 01:00:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:45,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,899 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-28 01:00:45,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:45,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264367101] [2021-12-28 01:00:45,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264367101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:45,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675875899] [2021-12-28 01:00:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:45,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:45,912 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-28 01:00:45,933 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-28 01:00:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:45,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 01:00:45,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:46,093 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-28 01:00:46,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:46,407 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-28 01:00:46,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675875899] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:46,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:46,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-28 01:00:46,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90593247] [2021-12-28 01:00:46,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:46,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-28 01:00:46,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-28 01:00:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-28 01:00:46,410 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-28 01:00:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:46,780 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-28 01:00:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 01:00:46,781 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-28 01:00:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:46,783 INFO L225 Difference]: With dead ends: 177 [2021-12-28 01:00:46,783 INFO L226 Difference]: Without dead ends: 117 [2021-12-28 01:00:46,784 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-28 01:00:46,785 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:46,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:00:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-28 01:00:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-28 01:00:46,799 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-28 01:00:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-28 01:00:46,801 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-28 01:00:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:46,802 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-28 01:00:46,802 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-28 01:00:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-28 01:00:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 01:00:46,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:46,805 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-28 01:00:46,833 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-28 01:00:47,029 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-28 01:00:47,029 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-28 01:00:47,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:47,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450340308] [2021-12-28 01:00:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:47,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 01:00:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,182 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-28 01:00:47,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:47,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450340308] [2021-12-28 01:00:47,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450340308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:47,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267427993] [2021-12-28 01:00:47,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:47,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:47,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:47,183 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-28 01:00:47,212 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-28 01:00:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:47,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 01:00:47,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:47,371 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-28 01:00:47,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:47,830 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-28 01:00:47,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267427993] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:47,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:47,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-28 01:00:47,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819124185] [2021-12-28 01:00:47,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:47,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 01:00:47,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 01:00:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-28 01:00:47,834 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-28 01:00:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:48,250 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-28 01:00:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 01:00:48,251 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-28 01:00:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:48,253 INFO L225 Difference]: With dead ends: 255 [2021-12-28 01:00:48,253 INFO L226 Difference]: Without dead ends: 155 [2021-12-28 01:00:48,255 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-28 01:00:48,255 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.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:48,256 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.3s Time] [2021-12-28 01:00:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-28 01:00:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-28 01:00:48,273 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-28 01:00:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-28 01:00:48,275 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-28 01:00:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:48,275 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-28 01:00:48,276 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-28 01:00:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-28 01:00:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-28 01:00:48,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:48,279 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-28 01:00:48,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 01:00:48,502 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-28 01:00:48,503 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-28 01:00:48,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:48,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287163099] [2021-12-28 01:00:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:48,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:00:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,715 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-28 01:00:48,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:48,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287163099] [2021-12-28 01:00:48,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287163099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:48,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729871980] [2021-12-28 01:00:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:48,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:48,720 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-28 01:00:48,746 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-28 01:00:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:48,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 01:00:48,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:49,041 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-28 01:00:49,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:49,852 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-28 01:00:49,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729871980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:49,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:49,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-12-28 01:00:49,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442300708] [2021-12-28 01:00:49,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:49,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-28 01:00:49,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-28 01:00:49,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-28 01:00:49,855 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-28 01:00:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:50,307 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-28 01:00:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-28 01:00:50,307 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2021-12-28 01:00:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:50,309 INFO L225 Difference]: With dead ends: 240 [2021-12-28 01:00:50,309 INFO L226 Difference]: Without dead ends: 107 [2021-12-28 01:00:50,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-12-28 01:00:50,311 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:50,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:00:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-28 01:00:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-28 01:00:50,321 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-28 01:00:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-28 01:00:50,323 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-28 01:00:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:50,323 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-28 01:00:50,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2021-12-28 01:00:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-28 01:00:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-28 01:00:50,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:50,329 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-28 01:00:50,359 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-28 01:00:50,550 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-28 01:00:50,550 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-28 01:00:50,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:50,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264559990] [2021-12-28 01:00:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:50,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:00:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 01:00:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,832 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-28 01:00:50,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264559990] [2021-12-28 01:00:50,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264559990] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380919863] [2021-12-28 01:00:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:50,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:50,834 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-28 01:00:50,858 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-28 01:00:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:50,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 01:00:50,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-28 01:00:51,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2021-12-28 01:00:52,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380919863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:52,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:52,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2021-12-28 01:00:52,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670592591] [2021-12-28 01:00:52,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:52,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 01:00:52,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 01:00:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-12-28 01:00:52,425 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-28 01:00:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:52,931 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-12-28 01:00:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-28 01:00:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2021-12-28 01:00:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:52,933 INFO L225 Difference]: With dead ends: 214 [2021-12-28 01:00:52,933 INFO L226 Difference]: Without dead ends: 134 [2021-12-28 01:00:52,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2021-12-28 01:00:52,935 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:52,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:00:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-28 01:00:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-28 01:00:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2021-12-28 01:00:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-12-28 01:00:52,946 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-12-28 01:00:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:52,946 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-12-28 01:00:52,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2021-12-28 01:00:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-12-28 01:00:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-28 01:00:52,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:52,950 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:00:52,978 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-28 01:00:53,175 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-28 01:00:53,176 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2021-12-28 01:00:53,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:53,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922080215] [2021-12-28 01:00:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:53,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:00:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:00:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-28 01:00:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:00:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:00:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2021-12-28 01:00:53,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:53,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922080215] [2021-12-28 01:00:53,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922080215] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:53,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573539041] [2021-12-28 01:00:53,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 01:00:53,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:53,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:53,639 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-28 01:00:53,672 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-28 01:00:53,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 01:00:53,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:00:53,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 01:00:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2021-12-28 01:00:54,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2021-12-28 01:00:56,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573539041] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:56,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:56,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2021-12-28 01:00:56,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192341950] [2021-12-28 01:00:56,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:56,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-28 01:00:56,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-28 01:00:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-12-28 01:00:56,015 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2021-12-28 01:00:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:56,589 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-12-28 01:00:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-28 01:00:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 271 [2021-12-28 01:00:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:56,594 INFO L225 Difference]: With dead ends: 260 [2021-12-28 01:00:56,594 INFO L226 Difference]: Without dead ends: 155 [2021-12-28 01:00:56,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2021-12-28 01:00:56,596 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:56,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 354 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:00:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-28 01:00:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-12-28 01:00:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2021-12-28 01:00:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-12-28 01:00:56,636 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2021-12-28 01:00:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:56,637 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-12-28 01:00:56,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2021-12-28 01:00:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-12-28 01:00:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-28 01:00:56,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:56,646 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:00:56,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 01:00:56,867 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-28 01:00:56,868 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2021-12-28 01:00:56,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919427612] [2021-12-28 01:00:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:56,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:00:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:00:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 01:00:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:00:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-28 01:00:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-28 01:00:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:00:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:00:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:00:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:00:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:00:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:00:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:00:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2021-12-28 01:00:57,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:00:57,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919427612] [2021-12-28 01:00:57,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919427612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:00:57,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456300508] [2021-12-28 01:00:57,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 01:00:57,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:00:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:00:57,584 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-28 01:00:57,610 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-28 01:00:57,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-28 01:00:57,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:00:57,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:00:57,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:00:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-28 01:00:58,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:00:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2021-12-28 01:00:59,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456300508] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:00:59,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:00:59,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2021-12-28 01:00:59,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307777501] [2021-12-28 01:00:59,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:00:59,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 01:00:59,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:00:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 01:00:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-12-28 01:00:59,420 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2021-12-28 01:00:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:00:59,600 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2021-12-28 01:00:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:00:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 394 [2021-12-28 01:00:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:00:59,603 INFO L225 Difference]: With dead ends: 283 [2021-12-28 01:00:59,603 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 01:00:59,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-12-28 01:00:59,604 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:00:59,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 199 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:00:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 01:00:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2021-12-28 01:00:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.198019801980198) internal successors, (121), 98 states have internal predecessors, (121), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (66), 26 states have call predecessors, (66), 26 states have call successors, (66) [2021-12-28 01:00:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2021-12-28 01:00:59,614 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2021-12-28 01:00:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:00:59,615 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2021-12-28 01:00:59,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2021-12-28 01:00:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2021-12-28 01:00:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2021-12-28 01:00:59,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:00:59,624 INFO L514 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:00:59,651 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-28 01:00:59,843 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-28 01:00:59,843 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:00:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:00:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2021-12-28 01:00:59,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:00:59,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681163527] [2021-12-28 01:00:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:00:59,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:00:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:01:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:01:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-12-28 01:01:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:01:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2021-12-28 01:01:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2021-12-28 01:01:01,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:01:01,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681163527] [2021-12-28 01:01:01,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681163527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:01:01,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091770154] [2021-12-28 01:01:01,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 01:01:01,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:01:01,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:01:01,016 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-28 01:01:01,044 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-28 01:01:01,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 01:01:01,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:01:01,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 01:01:01,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:01:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2021-12-28 01:01:02,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:01:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2021-12-28 01:01:05,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091770154] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:01:05,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:01:05,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2021-12-28 01:01:05,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337517313] [2021-12-28 01:01:05,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:01:05,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-28 01:01:05,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:01:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-28 01:01:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2021-12-28 01:01:05,113 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2021-12-28 01:01:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:01:06,193 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2021-12-28 01:01:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-28 01:01:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) Word has length 542 [2021-12-28 01:01:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:01:06,196 INFO L225 Difference]: With dead ends: 355 [2021-12-28 01:01:06,196 INFO L226 Difference]: Without dead ends: 183 [2021-12-28 01:01:06,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2021-12-28 01:01:06,199 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 175 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 01:01:06,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 624 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 01:01:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-28 01:01:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2021-12-28 01:01:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.091743119266055) internal successors, (119), 106 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 16 states have return successors, (42), 26 states have call predecessors, (42), 29 states have call successors, (42) [2021-12-28 01:01:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2021-12-28 01:01:06,210 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2021-12-28 01:01:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:01:06,210 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2021-12-28 01:01:06,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2021-12-28 01:01:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2021-12-28 01:01:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-12-28 01:01:06,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:01:06,213 INFO L514 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:01:06,241 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-28 01:01:06,435 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-28 01:01:06,435 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:01:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:01:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2021-12-28 01:01:06,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:01:06,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74613745] [2021-12-28 01:01:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:01:06,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:01:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:01:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:01:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-28 01:01:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-28 01:01:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:01:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:01:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:01:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:01:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:01:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:01:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:01:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2021-12-28 01:01:07,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:01:07,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74613745] [2021-12-28 01:01:07,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74613745] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:01:07,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831903828] [2021-12-28 01:01:07,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-28 01:01:07,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:01:07,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:01:07,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 01:01:07,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-28 01:01:07,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-28 01:01:07,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:01:07,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 01:01:07,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:01:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2021-12-28 01:01:08,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:01:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2021-12-28 01:01:09,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831903828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:01:09,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:01:09,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2021-12-28 01:01:09,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103882046] [2021-12-28 01:01:09,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:01:09,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-28 01:01:09,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:01:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-28 01:01:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2021-12-28 01:01:09,814 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2021-12-28 01:01:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:01:10,448 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2021-12-28 01:01:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-28 01:01:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) Word has length 433 [2021-12-28 01:01:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:01:10,453 INFO L225 Difference]: With dead ends: 333 [2021-12-28 01:01:10,453 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 01:01:10,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2021-12-28 01:01:10,457 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:01:10,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 689 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:01:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 01:01:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2021-12-28 01:01:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 110 states have internal predecessors, (118), 30 states have call successors, (30), 23 states have call predecessors, (30), 16 states have return successors, (41), 25 states have call predecessors, (41), 30 states have call successors, (41) [2021-12-28 01:01:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2021-12-28 01:01:10,472 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2021-12-28 01:01:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:01:10,475 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2021-12-28 01:01:10,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2021-12-28 01:01:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2021-12-28 01:01:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-28 01:01:10,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:01:10,478 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:01:10,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-28 01:01:10,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-28 01:01:10,691 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:01:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:01:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-12-28 01:01:10,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:01:10,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122465706] [2021-12-28 01:01:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:01:10,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:01:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:01:10,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 01:01:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 01:01:10,885 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 01:01:10,885 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 01:01:10,886 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:01:10,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 01:01:10,892 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:01:10,896 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:01:11,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:01:11 BoogieIcfgContainer [2021-12-28 01:01:11,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:01:11,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:01:11,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:01:11,024 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:01:11,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:00:42" (3/4) ... [2021-12-28 01:01:11,026 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 01:01:11,125 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:01:11,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:01:11,125 INFO L158 Benchmark]: Toolchain (without parser) took 29599.20ms. Allocated memory was 56.6MB in the beginning and 255.9MB in the end (delta: 199.2MB). Free memory was 36.1MB in the beginning and 176.7MB in the end (delta: -140.6MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2021-12-28 01:01:11,126 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:01:11,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.48ms. Allocated memory is still 56.6MB. Free memory was 36.0MB in the beginning and 40.9MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 01:01:11,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.39ms. Allocated memory is still 56.6MB. Free memory was 40.9MB in the beginning and 39.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:01:11,127 INFO L158 Benchmark]: Boogie Preprocessor took 35.83ms. Allocated memory is still 56.6MB. Free memory was 39.5MB in the beginning and 38.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:01:11,127 INFO L158 Benchmark]: RCFGBuilder took 296.83ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 29.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 01:01:11,128 INFO L158 Benchmark]: TraceAbstraction took 28919.82ms. Allocated memory was 56.6MB in the beginning and 255.9MB in the end (delta: 199.2MB). Free memory was 29.0MB in the beginning and 189.2MB in the end (delta: -160.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2021-12-28 01:01:11,128 INFO L158 Benchmark]: Witness Printer took 100.97ms. Allocated memory is still 255.9MB. Free memory was 188.2MB in the beginning and 176.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 01:01:11,131 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.20ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.2MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.48ms. Allocated memory is still 56.6MB. Free memory was 36.0MB in the beginning and 40.9MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.39ms. Allocated memory is still 56.6MB. Free memory was 40.9MB in the beginning and 39.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.83ms. Allocated memory is still 56.6MB. Free memory was 39.5MB in the beginning and 38.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 296.83ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 29.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28919.82ms. Allocated memory was 56.6MB in the beginning and 255.9MB in the end (delta: 199.2MB). Free memory was 29.0MB in the beginning and 189.2MB in the end (delta: -160.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 100.97ms. Allocated memory is still 255.9MB. Free memory was 188.2MB in the beginning and 176.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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 = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1049 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 3635 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3233 mSDsCounter, 1228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5472 IncrementalHoareTripleChecker+Invalid, 6700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1228 mSolverCounterUnsat, 402 mSDtfsCounter, 5472 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6142 ConstructedInterpolants, 0 QuantifiedInterpolants, 9059 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 56580/63747 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-28 01:01:11,187 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