./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 ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_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-ff03de6 [2021-12-21 13:19:28,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 13:19:28,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 13:19:28,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 13:19:28,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 13:19:28,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 13:19:28,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 13:19:28,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 13:19:28,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 13:19:28,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 13:19:28,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 13:19:28,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 13:19:28,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 13:19:28,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 13:19:28,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 13:19:28,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 13:19:28,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 13:19:28,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 13:19:28,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 13:19:28,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 13:19:28,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 13:19:28,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 13:19:28,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 13:19:28,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 13:19:28,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 13:19:28,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 13:19:28,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 13:19:28,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 13:19:28,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 13:19:28,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 13:19:28,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 13:19:28,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 13:19:28,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 13:19:28,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 13:19:28,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 13:19:28,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 13:19:28,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 13:19:28,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 13:19:28,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 13:19:28,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 13:19:28,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 13:19:28,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 13:19:28,807 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 13:19:28,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 13:19:28,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 13:19:28,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 13:19:28,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 13:19:28,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 13:19:28,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 13:19:28,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 13:19:28,809 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 13:19:28,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 13:19:28,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 13:19:28,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 13:19:28,811 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 13:19:28,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 13:19:28,811 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 13:19:28,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 13:19:28,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 13:19:28,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 13:19:28,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 13:19:28,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:19:28,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 13:19:28,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 13:19:28,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 13:19:28,814 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 13:19:28,814 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-21 13:19:29,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 13:19:29,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 13:19:29,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 13:19:29,027 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 13:19:29,027 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 13:19:29,028 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-21 13:19:29,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8651f7c01/273d8897450f4c06bfaf3b76a1f363a8/FLAGf3047c103 [2021-12-21 13:19:29,428 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 13:19:29,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-12-21 13:19:29,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8651f7c01/273d8897450f4c06bfaf3b76a1f363a8/FLAGf3047c103 [2021-12-21 13:19:29,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8651f7c01/273d8897450f4c06bfaf3b76a1f363a8 [2021-12-21 13:19:29,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 13:19:29,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 13:19:29,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 13:19:29,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 13:19:29,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 13:19:29,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:19:29" (1/1) ... [2021-12-21 13:19:29,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c66536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:29, skipping insertion in model container [2021-12-21 13:19:29,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:19:29" (1/1) ... [2021-12-21 13:19:29,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 13:19:29,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 13:19:30,032 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-21 13:19:30,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:19:30,041 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 13:19:30,091 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-21 13:19:30,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 13:19:30,103 INFO L208 MainTranslator]: Completed translation [2021-12-21 13:19:30,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30 WrapperNode [2021-12-21 13:19:30,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 13:19:30,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 13:19:30,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 13:19:30,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 13:19:30,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,125 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-21 13:19:30,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 13:19:30,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 13:19:30,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 13:19:30,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 13:19:30,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 13:19:30,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 13:19:30,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 13:19:30,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 13:19:30,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (1/1) ... [2021-12-21 13:19:30,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 13:19:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:30,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 13:19:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 13:19:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 13:19:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 13:19:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-21 13:19:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-21 13:19:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-21 13:19:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-21 13:19:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 13:19:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 13:19:30,267 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 13:19:30,269 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 13:19:30,347 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 13:19:30,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 13:19:30,352 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 13:19:30,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:30 BoogieIcfgContainer [2021-12-21 13:19:30,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 13:19:30,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 13:19:30,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 13:19:30,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 13:19:30,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:19:29" (1/3) ... [2021-12-21 13:19:30,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131473a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:19:30, skipping insertion in model container [2021-12-21 13:19:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:19:30" (2/3) ... [2021-12-21 13:19:30,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131473a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:19:30, skipping insertion in model container [2021-12-21 13:19:30,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:30" (3/3) ... [2021-12-21 13:19:30,377 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-12-21 13:19:30,381 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 13:19:30,381 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 13:19:30,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 13:19:30,437 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 13:19:30,443 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 13:19:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 13:19:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 13:19:30,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:30,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:30,466 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-21 13:19:30,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:30,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123444157] [2021-12-21 13:19:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:30,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:19:30,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123444157] [2021-12-21 13:19:30,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123444157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:19:30,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:19:30,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:19:30,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083679459] [2021-12-21 13:19:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:19:30,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:19:30,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:19:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:30,686 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:19:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:30,721 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-21 13:19:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:19:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-21 13:19:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:30,730 INFO L225 Difference]: With dead ends: 43 [2021-12-21 13:19:30,730 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 13:19:30,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:30,735 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:30,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:19:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 13:19:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-21 13:19:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-21 13:19:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-21 13:19:30,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-21 13:19:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:30,763 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-21 13:19:30,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:19:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-21 13:19:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 13:19:30,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:30,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:30,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 13:19:30,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-21 13:19:30,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:30,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114157975] [2021-12-21 13:19:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:30,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 13:19:30,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:30,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114157975] [2021-12-21 13:19:30,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114157975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 13:19:30,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 13:19:30,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 13:19:30,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452781644] [2021-12-21 13:19:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 13:19:30,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 13:19:30,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 13:19:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:30,845 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:19:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:30,865 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-21 13:19:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 13:19:30,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-21 13:19:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:30,868 INFO L225 Difference]: With dead ends: 33 [2021-12-21 13:19:30,868 INFO L226 Difference]: Without dead ends: 29 [2021-12-21 13:19:30,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 13:19:30,872 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:30,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 13:19:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-21 13:19:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-21 13:19:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-21 13:19:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-21 13:19:30,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-21 13:19:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:30,884 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-21 13:19:30,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 13:19:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-21 13:19:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 13:19:30,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:30,887 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:30,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 13:19:30,888 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-21 13:19:30,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488846433] [2021-12-21 13:19:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:30,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:19:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:31,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488846433] [2021-12-21 13:19:31,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488846433] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:31,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394828123] [2021-12-21 13:19:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:31,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:31,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:31,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 13:19:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:19:31,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394828123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:31,314 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:31,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-21 13:19:31,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670283249] [2021-12-21 13:19:31,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:31,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 13:19:31,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 13:19:31,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 13:19:31,316 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 13:19:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:31,417 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-21 13:19:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 13:19:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2021-12-21 13:19:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:31,419 INFO L225 Difference]: With dead ends: 55 [2021-12-21 13:19:31,419 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 13:19:31,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-21 13:19:31,420 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:31,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 13:19:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-21 13:19:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-21 13:19:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-21 13:19:31,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-21 13:19:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:31,425 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-21 13:19:31,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-21 13:19:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-21 13:19:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 13:19:31,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:31,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:31,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 13:19:31,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:31,640 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-21 13:19:31,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:31,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468314798] [2021-12-21 13:19:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:31,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468314798] [2021-12-21 13:19:31,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468314798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:31,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662647257] [2021-12-21 13:19:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:31,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:31,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:31,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 13:19:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:31,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:19:31,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 13:19:31,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662647257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:31,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:31,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-21 13:19:31,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794232565] [2021-12-21 13:19:31,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:31,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 13:19:31,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 13:19:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 13:19:31,948 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 13:19:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:32,056 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-21 13:19:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 13:19:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2021-12-21 13:19:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:32,058 INFO L225 Difference]: With dead ends: 51 [2021-12-21 13:19:32,058 INFO L226 Difference]: Without dead ends: 47 [2021-12-21 13:19:32,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-21 13:19:32,059 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:32,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-21 13:19:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-21 13:19:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-21 13:19:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-21 13:19:32,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-21 13:19:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:32,066 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-21 13:19:32,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 13:19:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-21 13:19:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 13:19:32,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:32,067 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:32,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 13:19:32,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 13:19:32,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-21 13:19:32,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:32,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325532569] [2021-12-21 13:19:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:32,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 13:19:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 13:19:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 13:19:32,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325532569] [2021-12-21 13:19:32,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325532569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084329259] [2021-12-21 13:19:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:32,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:32,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:32,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 13:19:32,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:19:32,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 13:19:32,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:19:32,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084329259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:32,763 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:32,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-21 13:19:32,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645023627] [2021-12-21 13:19:32,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:32,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 13:19:32,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 13:19:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-21 13:19:32,765 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:32,935 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-21 13:19:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 13:19:32,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-12-21 13:19:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:32,941 INFO L225 Difference]: With dead ends: 105 [2021-12-21 13:19:32,941 INFO L226 Difference]: Without dead ends: 63 [2021-12-21 13:19:32,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-21 13:19:32,945 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:32,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 13:19:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-21 13:19:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-21 13:19:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-12-21 13:19:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-21 13:19:32,967 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-21 13:19:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:32,968 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-21 13:19:32,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-21 13:19:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 13:19:32,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:32,976 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:32,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 13:19:33,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:33,177 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-21 13:19:33,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:33,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609027129] [2021-12-21 13:19:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:33,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 13:19:33,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609027129] [2021-12-21 13:19:33,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609027129] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483288710] [2021-12-21 13:19:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:33,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:33,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:33,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 13:19:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:33,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 13:19:33,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 13:19:33,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 13:19:33,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483288710] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:33,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:33,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-21 13:19:33,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81493357] [2021-12-21 13:19:33,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:33,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 13:19:33,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 13:19:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-21 13:19:33,712 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:33,971 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-21 13:19:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 13:19:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2021-12-21 13:19:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:33,974 INFO L225 Difference]: With dead ends: 177 [2021-12-21 13:19:33,974 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 13:19:33,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-21 13:19:33,975 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:33,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 13:19:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-21 13:19:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-12-21 13:19:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-21 13:19:33,986 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-21 13:19:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:33,987 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-21 13:19:33,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-21 13:19:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-21 13:19:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 13:19:33,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:33,989 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:34,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:34,205 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-21 13:19:34,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:34,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323006320] [2021-12-21 13:19:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:34,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 13:19:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 13:19:34,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323006320] [2021-12-21 13:19:34,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323006320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258524508] [2021-12-21 13:19:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:34,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:34,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:34,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:34,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 13:19:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:34,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 13:19:34,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 13:19:34,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 13:19:34,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258524508] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:34,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:34,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-21 13:19:34,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944870167] [2021-12-21 13:19:34,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:34,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 13:19:34,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 13:19:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-21 13:19:34,881 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-21 13:19:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:35,180 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-21 13:19:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 13:19:35,180 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2021-12-21 13:19:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:35,182 INFO L225 Difference]: With dead ends: 255 [2021-12-21 13:19:35,182 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 13:19:35,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2021-12-21 13:19:35,184 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:35,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 13:19:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 13:19:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-21 13:19:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-12-21 13:19:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-21 13:19:35,209 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-21 13:19:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:35,210 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-21 13:19:35,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-21 13:19:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-21 13:19:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-21 13:19:35,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:35,212 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:35,240 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-21 13:19:35,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:35,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-21 13:19:35,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:35,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927952060] [2021-12-21 13:19:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:35,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:19:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-21 13:19:35,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927952060] [2021-12-21 13:19:35,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927952060] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146777923] [2021-12-21 13:19:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:35,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:35,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:35,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 13:19:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:35,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 13:19:35,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-21 13:19:35,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-21 13:19:36,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146777923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:36,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:36,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-12-21 13:19:36,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215339404] [2021-12-21 13:19:36,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:36,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 13:19:36,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 13:19:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-12-21 13:19:36,513 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-21 13:19:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:36,886 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-21 13:19:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 13:19:36,887 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-21 13:19:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:36,888 INFO L225 Difference]: With dead ends: 240 [2021-12-21 13:19:36,888 INFO L226 Difference]: Without dead ends: 107 [2021-12-21 13:19:36,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 13:19:36,890 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:36,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:19:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-21 13:19:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-21 13:19:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-21 13:19:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-21 13:19:36,898 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-21 13:19:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:36,900 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-21 13:19:36,900 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-21 13:19:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-21 13:19:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-21 13:19:36,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:36,915 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:36,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:37,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:37,132 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-21 13:19:37,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:37,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210701869] [2021-12-21 13:19:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:37,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-21 13:19:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 13:19:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-21 13:19:37,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210701869] [2021-12-21 13:19:37,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210701869] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:37,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751401914] [2021-12-21 13:19:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:37,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:37,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:37,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 13:19:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:37,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 13:19:37,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:37,671 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-21 13:19:37,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:38,673 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-21 13:19:38,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751401914] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:38,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:38,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2021-12-21 13:19:38,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426146607] [2021-12-21 13:19:38,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:38,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 13:19:38,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 13:19:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-12-21 13:19:38,676 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-21 13:19:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:39,155 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-12-21 13:19:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-21 13:19:39,156 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-21 13:19:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:39,157 INFO L225 Difference]: With dead ends: 214 [2021-12-21 13:19:39,157 INFO L226 Difference]: Without dead ends: 134 [2021-12-21 13:19:39,160 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-21 13:19:39,160 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:39,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:19:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-21 13:19:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-12-21 13:19:39,167 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-21 13:19:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-12-21 13:19:39,168 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-12-21 13:19:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:39,168 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-12-21 13:19:39,169 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-21 13:19:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-12-21 13:19:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-21 13:19:39,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:39,171 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-21 13:19:39,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:39,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:39,372 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2021-12-21 13:19:39,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474909671] [2021-12-21 13:19:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:39,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 13:19:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-21 13:19:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 13:19:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:39,790 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-21 13:19:39,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474909671] [2021-12-21 13:19:39,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474909671] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606436925] [2021-12-21 13:19:39,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 13:19:39,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:39,791 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:39,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 13:19:39,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 13:19:39,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:39,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-21 13:19:39,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:40,336 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-21 13:19:40,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:41,896 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-21 13:19:41,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606436925] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:41,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:41,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2021-12-21 13:19:41,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657087682] [2021-12-21 13:19:41,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:41,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-21 13:19:41,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-21 13:19:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-12-21 13:19:41,898 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-21 13:19:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:42,372 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-12-21 13:19:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-21 13:19:42,373 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-21 13:19:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:42,375 INFO L225 Difference]: With dead ends: 260 [2021-12-21 13:19:42,375 INFO L226 Difference]: Without dead ends: 155 [2021-12-21 13:19:42,376 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-21 13:19:42,376 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:42,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 354 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 13:19:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-21 13:19:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-12-21 13:19:42,385 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-21 13:19:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-12-21 13:19:42,392 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2021-12-21 13:19:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:42,393 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-12-21 13:19:42,393 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-21 13:19:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-12-21 13:19:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-21 13:19:42,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:42,397 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-21 13:19:42,429 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-21 13:19:42,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 13:19:42,612 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2021-12-21 13:19:42,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:42,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506015066] [2021-12-21 13:19:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:42,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 13:19:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-21 13:19:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-21 13:19:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:19:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:43,200 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-21 13:19:43,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506015066] [2021-12-21 13:19:43,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506015066] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887044383] [2021-12-21 13:19:43,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 13:19:43,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:43,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:43,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 13:19:43,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-21 13:19:43,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:43,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 13:19:43,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:43,821 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-21 13:19:43,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:45,028 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-21 13:19:45,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887044383] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:45,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:45,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2021-12-21 13:19:45,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706833678] [2021-12-21 13:19:45,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:45,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 13:19:45,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:45,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 13:19:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-12-21 13:19:45,032 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-21 13:19:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:45,128 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2021-12-21 13:19:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 13:19:45,129 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-21 13:19:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:45,130 INFO L225 Difference]: With dead ends: 283 [2021-12-21 13:19:45,130 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 13:19:45,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-12-21 13:19:45,131 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-21 13:19:45,131 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-21 13:19:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 13:19:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2021-12-21 13:19:45,140 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-21 13:19:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2021-12-21 13:19:45,142 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2021-12-21 13:19:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:45,143 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2021-12-21 13:19:45,143 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-21 13:19:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2021-12-21 13:19:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2021-12-21 13:19:45,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:45,164 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-21 13:19:45,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:45,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:45,365 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2021-12-21 13:19:45,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:45,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995622885] [2021-12-21 13:19:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:45,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:19:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-12-21 13:19:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:19:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2021-12-21 13:19:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:46,258 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-21 13:19:46,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995622885] [2021-12-21 13:19:46,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995622885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647652303] [2021-12-21 13:19:46,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 13:19:46,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:46,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:46,260 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 13:19:46,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 13:19:46,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 13:19:46,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:46,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 13:19:46,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:47,140 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-21 13:19:47,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:49,576 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-21 13:19:49,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647652303] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:49,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:49,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2021-12-21 13:19:49,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474820176] [2021-12-21 13:19:49,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:49,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-21 13:19:49,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-21 13:19:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2021-12-21 13:19:49,579 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-21 13:19:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:50,594 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2021-12-21 13:19:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-21 13:19:50,595 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-21 13:19:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:50,596 INFO L225 Difference]: With dead ends: 355 [2021-12-21 13:19:50,596 INFO L226 Difference]: Without dead ends: 183 [2021-12-21 13:19:50,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2021-12-21 13:19:50,599 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 169 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:50,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 717 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 13:19:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-21 13:19:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2021-12-21 13:19:50,605 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-21 13:19:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2021-12-21 13:19:50,606 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2021-12-21 13:19:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:50,606 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2021-12-21 13:19:50,607 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-21 13:19:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2021-12-21 13:19:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2021-12-21 13:19:50,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:50,611 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-21 13:19:50,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 13:19:50,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 13:19:50,829 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2021-12-21 13:19:50,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:50,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973684218] [2021-12-21 13:19:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:50,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 13:19:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:19:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 13:19:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-21 13:19:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-21 13:19:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-21 13:19:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 13:19:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-21 13:19:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 13:19:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-21 13:19:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 13:19:51,536 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-21 13:19:51,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 13:19:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973684218] [2021-12-21 13:19:51,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973684218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 13:19:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181953377] [2021-12-21 13:19:51,537 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 13:19:51,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 13:19:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 13:19:51,538 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-21 13:19:51,539 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-21 13:19:51,725 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-12-21 13:19:51,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 13:19:51,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 13:19:51,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 13:19:52,328 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-21 13:19:52,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 13:19:54,007 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-21 13:19:54,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181953377] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 13:19:54,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 13:19:54,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2021-12-21 13:19:54,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113524943] [2021-12-21 13:19:54,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 13:19:54,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-21 13:19:54,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 13:19:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-21 13:19:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2021-12-21 13:19:54,009 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-21 13:19:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 13:19:54,788 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2021-12-21 13:19:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-21 13:19:54,788 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-21 13:19:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 13:19:54,790 INFO L225 Difference]: With dead ends: 333 [2021-12-21 13:19:54,790 INFO L226 Difference]: Without dead ends: 185 [2021-12-21 13:19:54,791 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-21 13:19:54,792 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 13:19:54,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 689 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 13:19:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-21 13:19:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2021-12-21 13:19:54,799 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-21 13:19:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2021-12-21 13:19:54,800 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2021-12-21 13:19:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 13:19:54,802 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2021-12-21 13:19:54,802 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-21 13:19:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2021-12-21 13:19:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-21 13:19:54,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 13:19:54,804 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-21 13:19:54,823 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-21 13:19:55,021 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-21 13:19:55,021 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 13:19:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 13:19:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-12-21 13:19:55,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 13:19:55,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231003280] [2021-12-21 13:19:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 13:19:55,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 13:19:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:19:55,084 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 13:19:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 13:19:55,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 13:19:55,235 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 13:19:55,236 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 13:19:55,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 13:19:55,248 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 13:19:55,251 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 13:19:55,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:19:55 BoogieIcfgContainer [2021-12-21 13:19:55,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 13:19:55,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 13:19:55,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 13:19:55,359 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 13:19:55,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:19:30" (3/4) ... [2021-12-21 13:19:55,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 13:19:55,423 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 13:19:55,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 13:19:55,425 INFO L158 Benchmark]: Toolchain (without parser) took 25549.50ms. Allocated memory was 81.8MB in the beginning and 314.6MB in the end (delta: 232.8MB). Free memory was 38.4MB in the beginning and 117.8MB in the end (delta: -79.5MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. [2021-12-21 13:19:55,425 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 58.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:19:55,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.06ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 38.2MB in the beginning and 77.0MB in the end (delta: -38.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2021-12-21 13:19:55,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.36ms. Allocated memory is still 98.6MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:19:55,426 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 74.9MB in the end (delta: 497.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 13:19:55,426 INFO L158 Benchmark]: RCFGBuilder took 199.43ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 64.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 13:19:55,427 INFO L158 Benchmark]: TraceAbstraction took 25004.75ms. Allocated memory was 98.6MB in the beginning and 314.6MB in the end (delta: 216.0MB). Free memory was 64.4MB in the beginning and 129.4MB in the end (delta: -65.0MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2021-12-21 13:19:55,427 INFO L158 Benchmark]: Witness Printer took 64.96ms. Allocated memory is still 314.6MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 13:19:55,430 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.14ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 58.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.06ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 38.2MB in the beginning and 77.0MB in the end (delta: -38.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.36ms. Allocated memory is still 98.6MB. Free memory was 77.0MB in the beginning and 75.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 74.9MB in the end (delta: 497.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 199.43ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 64.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25004.75ms. Allocated memory was 98.6MB in the beginning and 314.6MB in the end (delta: 216.0MB). Free memory was 64.4MB in the beginning and 129.4MB in the end (delta: -65.0MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. * Witness Printer took 64.96ms. Allocated memory is still 314.6MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 24.8s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1040 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 3728 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3318 mSDsCounter, 1217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5568 IncrementalHoareTripleChecker+Invalid, 6785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1217 mSolverCounterUnsat, 410 mSDtfsCounter, 5568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.8s 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.2s 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-21 13:19:55,477 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