./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 11:40:38,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 11:40:38,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 11:40:38,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 11:40:38,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 11:40:38,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 11:40:38,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 11:40:38,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 11:40:38,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 11:40:38,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 11:40:38,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 11:40:38,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 11:40:38,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 11:40:38,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 11:40:38,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 11:40:38,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 11:40:38,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 11:40:38,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 11:40:38,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 11:40:38,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 11:40:38,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 11:40:38,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 11:40:38,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 11:40:38,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 11:40:38,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 11:40:38,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 11:40:38,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 11:40:38,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 11:40:38,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 11:40:38,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 11:40:38,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 11:40:38,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 11:40:38,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 11:40:38,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 11:40:38,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 11:40:38,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 11:40:38,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 11:40:38,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 11:40:38,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 11:40:38,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 11:40:38,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 11:40:38,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 11:40:38,960 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 11:40:38,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 11:40:38,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 11:40:38,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 11:40:38,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 11:40:38,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 11:40:38,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 11:40:38,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 11:40:38,964 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 11:40:38,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 11:40:38,965 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 11:40:38,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 11:40:38,967 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 11:40:38,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 11:40:38,967 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 11:40:38,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 11:40:38,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 11:40:38,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 11:40:38,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 11:40:38,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:40:38,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 11:40:38,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 11:40:38,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 11:40:38,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 11:40:38,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 11:40:38,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 11:40:38,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 11:40:38,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 11:40:38,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 11:40:38,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2021-12-22 11:40:39,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 11:40:39,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 11:40:39,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 11:40:39,242 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 11:40:39,243 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 11:40:39,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-22 11:40:39,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed942e11/0121eae4d9da480db29b3ea687c80d40/FLAGfa20b44f4 [2021-12-22 11:40:39,727 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 11:40:39,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2021-12-22 11:40:39,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed942e11/0121eae4d9da480db29b3ea687c80d40/FLAGfa20b44f4 [2021-12-22 11:40:40,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed942e11/0121eae4d9da480db29b3ea687c80d40 [2021-12-22 11:40:40,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 11:40:40,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 11:40:40,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 11:40:40,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 11:40:40,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 11:40:40,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6f1135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40, skipping insertion in model container [2021-12-22 11:40:40,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 11:40:40,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 11:40:40,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-22 11:40:40,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:40:40,312 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 11:40:40,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2021-12-22 11:40:40,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:40:40,336 INFO L208 MainTranslator]: Completed translation [2021-12-22 11:40:40,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40 WrapperNode [2021-12-22 11:40:40,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 11:40:40,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 11:40:40,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 11:40:40,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 11:40:40,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,363 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-12-22 11:40:40,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 11:40:40,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 11:40:40,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 11:40:40,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 11:40:40,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 11:40:40,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 11:40:40,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 11:40:40,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 11:40:40,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (1/1) ... [2021-12-22 11:40:40,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:40:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:40,429 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-22 11:40:40,445 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-22 11:40:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 11:40:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 11:40:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-12-22 11:40:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-12-22 11:40:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-12-22 11:40:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-12-22 11:40:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 11:40:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 11:40:40,521 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 11:40:40,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 11:40:40,658 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 11:40:40,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 11:40:40,663 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 11:40:40,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:40 BoogieIcfgContainer [2021-12-22 11:40:40,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 11:40:40,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 11:40:40,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 11:40:40,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 11:40:40,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:40:40" (1/3) ... [2021-12-22 11:40:40,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29352eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:40:40, skipping insertion in model container [2021-12-22 11:40:40,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:40:40" (2/3) ... [2021-12-22 11:40:40,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29352eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:40:40, skipping insertion in model container [2021-12-22 11:40:40,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:40" (3/3) ... [2021-12-22 11:40:40,671 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2021-12-22 11:40:40,674 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 11:40:40,675 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 11:40:40,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 11:40:40,755 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-22 11:40:40,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 11:40:40,773 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-22 11:40:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 11:40:40,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:40,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:40,785 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-12-22 11:40:40,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218896074] [2021-12-22 11:40:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:40,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,078 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-22 11:40:41,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218896074] [2021-12-22 11:40:41,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218896074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:40:41,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:40:41,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:40:41,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987890109] [2021-12-22 11:40:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:40:41,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:40:41,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:40:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:41,122 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-22 11:40:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:41,172 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-22 11:40:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:40:41,175 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-22 11:40:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:41,181 INFO L225 Difference]: With dead ends: 43 [2021-12-22 11:40:41,182 INFO L226 Difference]: Without dead ends: 27 [2021-12-22 11:40:41,185 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-22 11:40:41,189 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-22 11:40:41,191 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-22 11:40:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-22 11:40:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-22 11:40:41,231 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-22 11:40:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-22 11:40:41,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-12-22 11:40:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:41,235 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-22 11:40:41,235 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-22 11:40:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-22 11:40:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 11:40:41,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:41,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:41,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 11:40:41,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-12-22 11:40:41,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:41,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390063281] [2021-12-22 11:40:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:41,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,324 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-22 11:40:41,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:41,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390063281] [2021-12-22 11:40:41,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390063281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:40:41,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:40:41,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:40:41,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989888176] [2021-12-22 11:40:41,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:40:41,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:40:41,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:40:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:40:41,328 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-22 11:40:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:41,346 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-22 11:40:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:40:41,347 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-22 11:40:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:41,349 INFO L225 Difference]: With dead ends: 33 [2021-12-22 11:40:41,350 INFO L226 Difference]: Without dead ends: 29 [2021-12-22 11:40:41,353 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-22 11:40:41,355 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-22 11:40:41,356 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-22 11:40:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-22 11:40:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-22 11:40:41,364 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-22 11:40:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-22 11:40:41,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-12-22 11:40:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:41,370 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-22 11:40:41,370 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-22 11:40:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-22 11:40:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 11:40:41,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:41,374 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-22 11:40:41,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 11:40:41,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-12-22 11:40:41,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:41,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459683706] [2021-12-22 11:40:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:41,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-22 11:40:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,532 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-22 11:40:41,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459683706] [2021-12-22 11:40:41,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459683706] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729838057] [2021-12-22 11:40:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:41,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:41,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:41,553 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-22 11:40:41,575 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-22 11:40:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:41,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:40:41,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:41,758 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-22 11:40:41,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:42,005 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-22 11:40:42,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729838057] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:42,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:42,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-22 11:40:42,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206922205] [2021-12-22 11:40:42,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:42,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 11:40:42,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 11:40:42,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:40:42,012 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-22 11:40:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:42,180 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-12-22 11:40:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 11:40:42,180 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-22 11:40:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:42,183 INFO L225 Difference]: With dead ends: 55 [2021-12-22 11:40:42,183 INFO L226 Difference]: Without dead ends: 31 [2021-12-22 11:40:42,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-12-22 11:40:42,188 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:42,188 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-22 11:40:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-22 11:40:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-22 11:40:42,204 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-22 11:40:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-22 11:40:42,206 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-12-22 11:40:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:42,207 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-22 11:40:42,208 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-22 11:40:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-22 11:40:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 11:40:42,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:42,212 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-22 11:40:42,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:42,423 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-22 11:40:42,424 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-12-22 11:40:42,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:42,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016972039] [2021-12-22 11:40:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:42,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:42,556 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-22 11:40:42,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:42,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016972039] [2021-12-22 11:40:42,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016972039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:42,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749694917] [2021-12-22 11:40:42,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:42,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:42,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:42,558 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-22 11:40:42,559 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-22 11:40:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:42,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:40:42,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:42,652 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-22 11:40:42,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:42,854 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-22 11:40:42,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749694917] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:42,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:42,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-22 11:40:42,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156238232] [2021-12-22 11:40:42,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:42,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 11:40:42,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:42,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 11:40:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:40:42,856 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-22 11:40:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:42,986 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-22 11:40:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 11:40:42,987 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-22 11:40:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:42,989 INFO L225 Difference]: With dead ends: 51 [2021-12-22 11:40:42,989 INFO L226 Difference]: Without dead ends: 47 [2021-12-22 11:40:42,989 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-22 11:40:42,990 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-22 11:40:42,990 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-22 11:40:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-22 11:40:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-22 11:40:42,999 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-22 11:40:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-12-22 11:40:43,001 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-12-22 11:40:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:43,001 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-12-22 11:40:43,001 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-22 11:40:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-12-22 11:40:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 11:40:43,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:43,003 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-22 11:40:43,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:43,207 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-22 11:40:43,208 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-12-22 11:40:43,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:43,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861825072] [2021-12-22 11:40:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:43,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-22 11:40:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 11:40:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,342 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-22 11:40:43,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:43,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861825072] [2021-12-22 11:40:43,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861825072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:43,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77294643] [2021-12-22 11:40:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:43,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:43,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:43,344 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-22 11:40:43,347 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-22 11:40:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:43,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:40:43,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:43,498 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-22 11:40:43,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:43,854 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-22 11:40:43,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77294643] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:43,855 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:43,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2021-12-22 11:40:43,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374681627] [2021-12-22 11:40:43,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:43,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 11:40:43,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 11:40:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-22 11:40:43,859 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-22 11:40:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:44,068 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-12-22 11:40:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 11:40:44,069 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-22 11:40:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:44,070 INFO L225 Difference]: With dead ends: 105 [2021-12-22 11:40:44,071 INFO L226 Difference]: Without dead ends: 63 [2021-12-22 11:40:44,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-12-22 11:40:44,072 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-22 11:40:44,073 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-22 11:40:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-22 11:40:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-22 11:40:44,091 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-22 11:40:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-12-22 11:40:44,092 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-12-22 11:40:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:44,093 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-12-22 11:40:44,093 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-22 11:40:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-12-22 11:40:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 11:40:44,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:44,095 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-22 11:40:44,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 11:40:44,299 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-22 11:40:44,300 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-12-22 11:40:44,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:44,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223723674] [2021-12-22 11:40:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:44,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,411 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-22 11:40:44,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223723674] [2021-12-22 11:40:44,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223723674] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295252478] [2021-12-22 11:40:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:44,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:44,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:44,413 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-22 11:40:44,439 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-22 11:40:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:44,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:40:44,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:44,595 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-22 11:40:44,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:44,891 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-22 11:40:44,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295252478] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:44,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:44,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2021-12-22 11:40:44,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978485369] [2021-12-22 11:40:44,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:44,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 11:40:44,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 11:40:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-12-22 11:40:44,893 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-22 11:40:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:45,263 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-12-22 11:40:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 11:40:45,263 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-22 11:40:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:45,266 INFO L225 Difference]: With dead ends: 177 [2021-12-22 11:40:45,266 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 11:40:45,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-22 11:40:45,268 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:45,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:40:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 11:40:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-12-22 11:40:45,283 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-22 11:40:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-12-22 11:40:45,286 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-12-22 11:40:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:45,286 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-12-22 11:40:45,286 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-22 11:40:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-12-22 11:40:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-22 11:40:45,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:45,290 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-22 11:40:45,316 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-22 11:40:45,513 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-22 11:40:45,514 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-12-22 11:40:45,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:45,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937798312] [2021-12-22 11:40:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:45,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-22 11:40:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,648 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-22 11:40:45,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:45,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937798312] [2021-12-22 11:40:45,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937798312] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:45,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002940687] [2021-12-22 11:40:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:45,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:45,650 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-22 11:40:45,671 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-22 11:40:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:45,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 11:40:45,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:45,845 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-22 11:40:45,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:46,361 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-22 11:40:46,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002940687] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:46,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:46,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2021-12-22 11:40:46,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77351105] [2021-12-22 11:40:46,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:46,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 11:40:46,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 11:40:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-12-22 11:40:46,365 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-22 11:40:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:46,788 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-12-22 11:40:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 11:40:46,789 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 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-22 11:40:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:46,791 INFO L225 Difference]: With dead ends: 255 [2021-12-22 11:40:46,791 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 11:40:46,793 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-22 11:40:46,793 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:46,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:40:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 11:40:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-22 11:40:46,814 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-22 11:40:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-12-22 11:40:46,820 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-12-22 11:40:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:46,821 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-12-22 11:40:46,821 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-22 11:40:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-12-22 11:40:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 11:40:46,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:46,838 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-22 11:40:46,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-22 11:40:47,039 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-22 11:40:47,039 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2021-12-22 11:40:47,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:47,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123390275] [2021-12-22 11:40:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:47,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 11:40:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,292 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-22 11:40:47,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:47,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123390275] [2021-12-22 11:40:47,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123390275] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836565618] [2021-12-22 11:40:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:47,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:47,295 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-22 11:40:47,323 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-22 11:40:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:47,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:40:47,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:47,585 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-22 11:40:47,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:48,369 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-22 11:40:48,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836565618] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:48,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:48,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-12-22 11:40:48,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530734918] [2021-12-22 11:40:48,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:48,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 11:40:48,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:48,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 11:40:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-12-22 11:40:48,371 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-22 11:40:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:48,801 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-12-22 11:40:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 11:40:48,802 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) Word has length 93 [2021-12-22 11:40:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:48,803 INFO L225 Difference]: With dead ends: 240 [2021-12-22 11:40:48,804 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 11:40:48,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 11:40:48,806 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:48,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 237 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:40:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 11:40:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-12-22 11:40:48,819 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-22 11:40:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-12-22 11:40:48,820 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2021-12-22 11:40:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:48,821 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-12-22 11:40:48,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2021-12-22 11:40:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-12-22 11:40:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-22 11:40:48,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:48,823 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-22 11:40:48,851 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-22 11:40:49,051 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-22 11:40:49,052 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-12-22 11:40:49,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362985100] [2021-12-22 11:40:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:49,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 11:40:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-22 11:40:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,336 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-22 11:40:49,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362985100] [2021-12-22 11:40:49,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362985100] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497586263] [2021-12-22 11:40:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:49,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:49,338 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-22 11:40:49,365 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-22 11:40:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:49,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 11:40:49,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 121 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-12-22 11:40:49,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 60 proven. 126 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-12-22 11:40:50,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497586263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:50,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:50,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2021-12-22 11:40:50,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929850973] [2021-12-22 11:40:50,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:50,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 11:40:50,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 11:40:50,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-22 11:40:50,425 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-22 11:40:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:50,757 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-22 11:40:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 11:40:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-22 11:40:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:50,759 INFO L225 Difference]: With dead ends: 169 [2021-12-22 11:40:50,759 INFO L226 Difference]: Without dead ends: 93 [2021-12-22 11:40:50,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2021-12-22 11:40:50,761 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:50,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 270 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-22 11:40:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-12-22 11:40:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (35), 18 states have call predecessors, (35), 14 states have call successors, (35) [2021-12-22 11:40:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2021-12-22 11:40:50,771 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 148 [2021-12-22 11:40:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:50,771 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2021-12-22 11:40:50,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-22 11:40:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2021-12-22 11:40:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-22 11:40:50,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:50,774 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:50,799 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-22 11:40:50,991 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-22 11:40:50,992 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2043735506, now seen corresponding path program 2 times [2021-12-22 11:40:50,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144346423] [2021-12-22 11:40:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:50,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:40:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-22 11:40:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-22 11:40:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 112 proven. 115 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-12-22 11:40:51,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144346423] [2021-12-22 11:40:51,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144346423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544423585] [2021-12-22 11:40:51,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 11:40:51,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:51,283 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-22 11:40:51,283 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-22 11:40:51,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 11:40:51,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:40:51,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 11:40:51,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 101 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-12-22 11:40:51,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 80 proven. 106 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-22 11:40:52,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544423585] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:52,346 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:52,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 21 [2021-12-22 11:40:52,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037813445] [2021-12-22 11:40:52,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:52,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 11:40:52,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:52,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 11:40:52,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-12-22 11:40:52,348 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-22 11:40:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:52,672 INFO L93 Difference]: Finished difference Result 184 states and 267 transitions. [2021-12-22 11:40:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-22 11:40:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-12-22 11:40:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:52,674 INFO L225 Difference]: With dead ends: 184 [2021-12-22 11:40:52,674 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 11:40:52,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-12-22 11:40:52,675 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:52,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 268 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 11:40:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2021-12-22 11:40:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (33), 18 states have call predecessors, (33), 14 states have call successors, (33) [2021-12-22 11:40:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2021-12-22 11:40:52,683 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 148 [2021-12-22 11:40:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:52,684 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2021-12-22 11:40:52,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 21 states have internal predecessors, (72), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2021-12-22 11:40:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2021-12-22 11:40:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-22 11:40:52,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:52,686 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:52,714 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-22 11:40:52,899 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-22 11:40:52,900 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -552714558, now seen corresponding path program 3 times [2021-12-22 11:40:52,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:52,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642046030] [2021-12-22 11:40:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:52,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:40:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-22 11:40:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 207 proven. 121 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2021-12-22 11:40:53,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642046030] [2021-12-22 11:40:53,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642046030] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:53,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400846568] [2021-12-22 11:40:53,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 11:40:53,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:53,242 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-22 11:40:53,244 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-22 11:40:53,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-22 11:40:53,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:40:53,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:40:53,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 32 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2021-12-22 11:40:53,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 135 proven. 34 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2021-12-22 11:40:54,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400846568] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:54,242 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:54,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 24 [2021-12-22 11:40:54,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410598859] [2021-12-22 11:40:54,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:54,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-22 11:40:54,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-22 11:40:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-12-22 11:40:54,244 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-22 11:40:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:54,561 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-12-22 11:40:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-22 11:40:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) Word has length 174 [2021-12-22 11:40:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:54,564 INFO L225 Difference]: With dead ends: 187 [2021-12-22 11:40:54,564 INFO L226 Difference]: Without dead ends: 106 [2021-12-22 11:40:54,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 11:40:54,565 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:54,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 276 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:40:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-22 11:40:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2021-12-22 11:40:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 14 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2021-12-22 11:40:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2021-12-22 11:40:54,572 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 174 [2021-12-22 11:40:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:54,573 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2021-12-22 11:40:54,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2021-12-22 11:40:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2021-12-22 11:40:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-22 11:40:54,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:54,575 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:54,601 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-22 11:40:54,791 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-22 11:40:54,791 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash -712391191, now seen corresponding path program 4 times [2021-12-22 11:40:54,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706048532] [2021-12-22 11:40:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:54,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-22 11:40:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-22 11:40:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-22 11:40:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 194 proven. 345 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2021-12-22 11:40:55,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706048532] [2021-12-22 11:40:55,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706048532] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840419414] [2021-12-22 11:40:55,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 11:40:55,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:55,236 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-22 11:40:55,260 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-22 11:40:55,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 11:40:55,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:40:55,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:40:55,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 97 proven. 261 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2021-12-22 11:40:55,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 101 proven. 265 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2021-12-22 11:40:56,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840419414] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:56,799 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:56,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 13] total 33 [2021-12-22 11:40:56,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589240782] [2021-12-22 11:40:56,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:56,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-22 11:40:56,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-22 11:40:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 11:40:56,801 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-22 11:40:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:57,638 INFO L93 Difference]: Finished difference Result 250 states and 417 transitions. [2021-12-22 11:40:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-22 11:40:57,638 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) Word has length 217 [2021-12-22 11:40:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:57,640 INFO L225 Difference]: With dead ends: 250 [2021-12-22 11:40:57,640 INFO L226 Difference]: Without dead ends: 131 [2021-12-22 11:40:57,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2021-12-22 11:40:57,643 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 159 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:57,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 520 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 11:40:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-22 11:40:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2021-12-22 11:40:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 83 states have internal predecessors, (96), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-22 11:40:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2021-12-22 11:40:57,652 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 217 [2021-12-22 11:40:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:57,653 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2021-12-22 11:40:57,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.875) internal successors, (92), 33 states have internal predecessors, (92), 19 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (36), 25 states have call predecessors, (36), 19 states have call successors, (36) [2021-12-22 11:40:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2021-12-22 11:40:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-22 11:40:57,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:57,656 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:57,683 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-22 11:40:57,871 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-22 11:40:57,871 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:40:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:40:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1374317944, now seen corresponding path program 5 times [2021-12-22 11:40:57,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:40:57,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868677479] [2021-12-22 11:40:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:40:57,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:40:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:40:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:57,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:40:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-22 11:40:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-22 11:40:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:40:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:40:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:40:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:40:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:40:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 155 proven. 209 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2021-12-22 11:40:58,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:40:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868677479] [2021-12-22 11:40:58,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868677479] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:40:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429409054] [2021-12-22 11:40:58,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-22 11:40:58,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:40:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:40:58,172 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-22 11:40:58,173 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-22 11:40:58,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-22 11:40:58,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:40:58,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:40:58,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:40:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 638 proven. 46 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2021-12-22 11:40:58,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:40:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 143 proven. 256 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2021-12-22 11:40:59,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429409054] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:40:59,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:40:59,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2021-12-22 11:40:59,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521118843] [2021-12-22 11:40:59,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:40:59,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-22 11:40:59,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:40:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 11:40:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-12-22 11:40:59,585 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 14 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (33), 14 states have call predecessors, (33), 14 states have call successors, (33) [2021-12-22 11:40:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:40:59,805 INFO L93 Difference]: Finished difference Result 226 states and 275 transitions. [2021-12-22 11:40:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 11:40:59,805 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 14 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (33), 14 states have call predecessors, (33), 14 states have call successors, (33) Word has length 201 [2021-12-22 11:40:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:40:59,806 INFO L225 Difference]: With dead ends: 226 [2021-12-22 11:40:59,806 INFO L226 Difference]: Without dead ends: 106 [2021-12-22 11:40:59,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2021-12-22 11:40:59,808 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:40:59,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 320 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:40:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-22 11:40:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-22 11:40:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.077922077922078) internal successors, (83), 72 states have internal predecessors, (83), 16 states have call successors, (16), 16 states have call predecessors, (16), 12 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-22 11:40:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-12-22 11:40:59,815 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 201 [2021-12-22 11:40:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:40:59,815 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-12-22 11:40:59,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 14 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (33), 14 states have call predecessors, (33), 14 states have call successors, (33) [2021-12-22 11:40:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-12-22 11:40:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-22 11:40:59,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:40:59,817 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:40:59,844 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-22 11:41:00,044 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-22 11:41:00,044 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:41:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:41:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 521886258, now seen corresponding path program 6 times [2021-12-22 11:41:00,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:41:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106087982] [2021-12-22 11:41:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:41:00,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:41:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:41:00,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 11:41:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:41:00,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 11:41:00,113 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 11:41:00,114 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 11:41:00,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 11:41:00,120 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:41:00,123 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 11:41:00,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:41:00 BoogieIcfgContainer [2021-12-22 11:41:00,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 11:41:00,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 11:41:00,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 11:41:00,198 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 11:41:00,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:40:40" (3/4) ... [2021-12-22 11:41:00,200 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 11:41:00,276 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 11:41:00,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 11:41:00,277 INFO L158 Benchmark]: Toolchain (without parser) took 20137.05ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 54.6MB in the beginning and 72.8MB in the end (delta: -18.2MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,277 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:41:00,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.93ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 67.6MB in the end (delta: -13.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.13ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,278 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 65.3MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:41:00,279 INFO L158 Benchmark]: RCFGBuilder took 269.08ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 56.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,279 INFO L158 Benchmark]: TraceAbstraction took 19531.36ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 55.8MB in the beginning and 78.0MB in the end (delta: -22.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,279 INFO L158 Benchmark]: Witness Printer took 78.44ms. Allocated memory is still 192.9MB. Free memory was 78.0MB in the beginning and 72.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 11:41:00,282 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.31ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.93ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 67.6MB in the end (delta: -13.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.13ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 65.3MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.08ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 56.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19531.36ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 55.8MB in the beginning and 78.0MB in the end (delta: -22.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Witness Printer took 78.44ms. Allocated memory is still 192.9MB. Free memory was 78.0MB in the beginning and 72.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] reach_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 17, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 944 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 878 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2693 mSDsCounter, 985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4514 IncrementalHoareTripleChecker+Invalid, 5499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 985 mSolverCounterUnsat, 384 mSDtfsCounter, 4514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2869 GetRequests, 2540 SyntacticMatches, 19 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=12, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 142 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 2499 NumberOfCodeBlocks, 2231 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3442 ConstructedInterpolants, 0 QuantifiedInterpolants, 5883 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2157 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 10983/13626 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-22 11:41:00,331 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