./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/hard.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de1bb103 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/nla-digbench/hard.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f1c45558152fd199606f2551fe8da5ad92b45c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/nla-digbench/hard.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f1c45558152fd199606f2551fe8da5ad92b45c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:08:28,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:08:28,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:08:28,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:08:28,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:08:28,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:08:28,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:08:28,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:08:28,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:08:28,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:08:28,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:08:28,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:08:28,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:08:28,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:08:28,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:08:28,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:08:28,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:08:28,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:08:28,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:08:28,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:08:28,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:08:28,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:08:28,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:08:28,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:08:28,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:08:28,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:08:28,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:08:28,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:08:28,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:08:28,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:08:28,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:08:28,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:08:28,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:08:28,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:08:28,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:08:28,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:08:28,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:08:28,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:08:28,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:08:28,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:08:28,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:08:28,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 13:08:28,769 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:08:28,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:08:28,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:08:28,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:08:28,772 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:08:28,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:08:28,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:08:28,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 13:08:28,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:08:28,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:08:28,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 13:08:28,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:08:28,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 13:08:28,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:08:28,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 13:08:28,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:08:28,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 13:08:28,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:08:28,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:08:28,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:08:28,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:08:28,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:08:28,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:08:28,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:08:28,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 13:08:28,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 13:08:28,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 13:08:28,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 13:08:28,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> e0f1c45558152fd199606f2551fe8da5ad92b45c [2019-11-27 13:08:29,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:08:29,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:08:29,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:08:29,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:08:29,120 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:08:29,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/hard.c [2019-11-27 13:08:29,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55423e5c/c4135bde3f214bf5a26edb37b6831d8b/FLAGd83b614cd [2019-11-27 13:08:29,636 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:08:29,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/hard.c [2019-11-27 13:08:29,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55423e5c/c4135bde3f214bf5a26edb37b6831d8b/FLAGd83b614cd [2019-11-27 13:08:30,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55423e5c/c4135bde3f214bf5a26edb37b6831d8b [2019-11-27 13:08:30,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:08:30,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 13:08:30,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:08:30,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:08:30,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:08:30,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c37002e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30, skipping insertion in model container [2019-11-27 13:08:30,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:08:30,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:08:30,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:08:30,262 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 13:08:30,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:08:30,292 INFO L208 MainTranslator]: Completed translation [2019-11-27 13:08:30,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30 WrapperNode [2019-11-27 13:08:30,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:08:30,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 13:08:30,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 13:08:30,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 13:08:30,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 13:08:30,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 13:08:30,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 13:08:30,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 13:08:30,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... [2019-11-27 13:08:30,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 13:08:30,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 13:08:30,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 13:08:30,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 13:08:30,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:08:30,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 13:08:30,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 13:08:30,778 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 13:08:30,778 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-27 13:08:30,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:08:30 BoogieIcfgContainer [2019-11-27 13:08:30,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 13:08:30,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 13:08:30,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 13:08:30,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 13:08:30,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 01:08:30" (1/3) ... [2019-11-27 13:08:30,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268959ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:08:30, skipping insertion in model container [2019-11-27 13:08:30,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:08:30" (2/3) ... [2019-11-27 13:08:30,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268959ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:08:30, skipping insertion in model container [2019-11-27 13:08:30,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:08:30" (3/3) ... [2019-11-27 13:08:30,789 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-11-27 13:08:30,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 13:08:30,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-27 13:08:30,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-27 13:08:30,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 13:08:30,857 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 13:08:30,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 13:08:30,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 13:08:30,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 13:08:30,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 13:08:30,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 13:08:30,859 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 13:08:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-27 13:08:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 13:08:30,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:30,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 13:08:30,881 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 963340, now seen corresponding path program 1 times [2019-11-27 13:08:30,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:30,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145677576] [2019-11-27 13:08:30,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:31,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145677576] [2019-11-27 13:08:31,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:08:31,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 13:08:31,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690998458] [2019-11-27 13:08:31,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:08:31,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:08:31,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:08:31,098 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-27 13:08:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:31,303 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2019-11-27 13:08:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:08:31,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-27 13:08:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:31,323 INFO L225 Difference]: With dead ends: 92 [2019-11-27 13:08:31,323 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 13:08:31,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:08:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 13:08:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2019-11-27 13:08:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 13:08:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-27 13:08:31,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2019-11-27 13:08:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:31,387 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-27 13:08:31,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:08:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-27 13:08:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 13:08:31,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:31,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 13:08:31,391 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash 925925231, now seen corresponding path program 1 times [2019-11-27 13:08:31,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:31,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14226137] [2019-11-27 13:08:31,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:31,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14226137] [2019-11-27 13:08:31,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:08:31,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 13:08:31,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345222918] [2019-11-27 13:08:31,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:08:31,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:08:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:08:31,485 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2019-11-27 13:08:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:31,590 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-27 13:08:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:08:31,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-27 13:08:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:31,592 INFO L225 Difference]: With dead ends: 49 [2019-11-27 13:08:31,592 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 13:08:31,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:08:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 13:08:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-27 13:08:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 13:08:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-27 13:08:31,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2019-11-27 13:08:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:31,603 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-27 13:08:31,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:08:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-27 13:08:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 13:08:31,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:31,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:31,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 756072562, now seen corresponding path program 1 times [2019-11-27 13:08:31,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958231581] [2019-11-27 13:08:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:31,618 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:31,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067767217] [2019-11-27 13:08:31,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:31,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 13:08:31,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:31,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958231581] [2019-11-27 13:08:31,730 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:31,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067767217] [2019-11-27 13:08:31,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:08:31,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 13:08:31,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175863830] [2019-11-27 13:08:31,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:08:31,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:08:31,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:08:31,733 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-11-27 13:08:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:31,854 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-27 13:08:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 13:08:31,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-27 13:08:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:31,856 INFO L225 Difference]: With dead ends: 69 [2019-11-27 13:08:31,857 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 13:08:31,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:08:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 13:08:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2019-11-27 13:08:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 13:08:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-27 13:08:31,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2019-11-27 13:08:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:31,870 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-27 13:08:31,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:08:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-27 13:08:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 13:08:31,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:31,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:32,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:32,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107943, now seen corresponding path program 1 times [2019-11-27 13:08:32,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:32,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130876216] [2019-11-27 13:08:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:32,098 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:32,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502463430] [2019-11-27 13:08:32,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:32,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 13:08:32,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:32,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130876216] [2019-11-27 13:08:32,165 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:32,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502463430] [2019-11-27 13:08:32,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:08:32,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 13:08:32,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232431956] [2019-11-27 13:08:32,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 13:08:32,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 13:08:32,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 13:08:32,168 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-11-27 13:08:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:32,293 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-11-27 13:08:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 13:08:32,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-27 13:08:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:32,294 INFO L225 Difference]: With dead ends: 60 [2019-11-27 13:08:32,295 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 13:08:32,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:08:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 13:08:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-11-27 13:08:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 13:08:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-27 13:08:32,316 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-11-27 13:08:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:32,316 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-27 13:08:32,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 13:08:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-27 13:08:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 13:08:32,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:32,318 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-27 13:08:32,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:32,523 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:32,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1240091547, now seen corresponding path program 1 times [2019-11-27 13:08:32,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:32,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026216713] [2019-11-27 13:08:32,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:32,533 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:32,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693013573] [2019-11-27 13:08:32,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:32,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 13:08:32,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:32,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:32,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026216713] [2019-11-27 13:08:32,660 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:32,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693013573] [2019-11-27 13:08:32,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:32,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-11-27 13:08:32,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403307125] [2019-11-27 13:08:32,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:08:32,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:08:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:08:32,662 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2019-11-27 13:08:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:32,823 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-11-27 13:08:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 13:08:32,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 13:08:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:32,825 INFO L225 Difference]: With dead ends: 105 [2019-11-27 13:08:32,825 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 13:08:32,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:08:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 13:08:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-27 13:08:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-27 13:08:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-27 13:08:32,849 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2019-11-27 13:08:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:32,850 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-27 13:08:32,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:08:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-27 13:08:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 13:08:32,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:32,852 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-27 13:08:33,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:33,056 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1654747054, now seen corresponding path program 2 times [2019-11-27 13:08:33,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:33,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173490402] [2019-11-27 13:08:33,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:33,065 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:33,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576521152] [2019-11-27 13:08:33,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:33,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 13:08:33,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:08:33,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 13:08:33,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:33,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173490402] [2019-11-27 13:08:33,189 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576521152] [2019-11-27 13:08:33,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:33,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-27 13:08:33,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026740569] [2019-11-27 13:08:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:08:33,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:33,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:08:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:08:33,192 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 6 states. [2019-11-27 13:08:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:33,411 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2019-11-27 13:08:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:08:33,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-27 13:08:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:33,414 INFO L225 Difference]: With dead ends: 139 [2019-11-27 13:08:33,414 INFO L226 Difference]: Without dead ends: 102 [2019-11-27 13:08:33,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:08:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-27 13:08:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2019-11-27 13:08:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-27 13:08:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-11-27 13:08:33,429 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2019-11-27 13:08:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:33,430 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-11-27 13:08:33,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:08:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-11-27 13:08:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 13:08:33,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:33,431 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:33,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:33,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1585354123, now seen corresponding path program 1 times [2019-11-27 13:08:33,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:33,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458506311] [2019-11-27 13:08:33,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:33,644 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:33,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862422378] [2019-11-27 13:08:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:33,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-27 13:08:33,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:33,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:33,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458506311] [2019-11-27 13:08:33,771 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:33,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862422378] [2019-11-27 13:08:33,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:33,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-27 13:08:33,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607330154] [2019-11-27 13:08:33,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:08:33,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:08:33,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:08:33,775 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2019-11-27 13:08:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:33,984 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-27 13:08:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 13:08:33,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 13:08:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:33,985 INFO L225 Difference]: With dead ends: 99 [2019-11-27 13:08:33,985 INFO L226 Difference]: Without dead ends: 97 [2019-11-27 13:08:33,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:08:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-27 13:08:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2019-11-27 13:08:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-27 13:08:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-11-27 13:08:33,999 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 24 [2019-11-27 13:08:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:33,999 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-11-27 13:08:34,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:08:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-11-27 13:08:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 13:08:34,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:34,001 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:34,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:34,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1185426063, now seen corresponding path program 1 times [2019-11-27 13:08:34,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:34,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031943382] [2019-11-27 13:08:34,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:34,220 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:34,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88451792] [2019-11-27 13:08:34,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:34,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 13:08:34,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-27 13:08:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031943382] [2019-11-27 13:08:34,305 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:34,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88451792] [2019-11-27 13:08:34,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:34,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-27 13:08:34,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529182378] [2019-11-27 13:08:34,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:08:34,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:08:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:08:34,307 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 6 states. [2019-11-27 13:08:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:34,444 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2019-11-27 13:08:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 13:08:34,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-27 13:08:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:34,446 INFO L225 Difference]: With dead ends: 120 [2019-11-27 13:08:34,446 INFO L226 Difference]: Without dead ends: 105 [2019-11-27 13:08:34,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:08:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-27 13:08:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-11-27 13:08:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 13:08:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-27 13:08:34,459 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 29 [2019-11-27 13:08:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:34,460 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-27 13:08:34,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:08:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-27 13:08:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 13:08:34,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:34,462 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2019-11-27 13:08:34,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:34,665 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1363992507, now seen corresponding path program 3 times [2019-11-27 13:08:34,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:34,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093841645] [2019-11-27 13:08:34,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:34,676 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:34,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747246925] [2019-11-27 13:08:34,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:34,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-27 13:08:34,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:08:34,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 13:08:34,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:34,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:34,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-27 13:08:34,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093841645] [2019-11-27 13:08:34,836 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:34,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747246925] [2019-11-27 13:08:34,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:34,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-27 13:08:34,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848069404] [2019-11-27 13:08:34,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 13:08:34,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 13:08:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:08:34,838 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 7 states. [2019-11-27 13:08:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:35,208 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-11-27 13:08:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:08:35,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-27 13:08:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:35,214 INFO L225 Difference]: With dead ends: 113 [2019-11-27 13:08:35,214 INFO L226 Difference]: Without dead ends: 103 [2019-11-27 13:08:35,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:08:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-27 13:08:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-27 13:08:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-27 13:08:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-11-27 13:08:35,226 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 29 [2019-11-27 13:08:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:35,227 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-11-27 13:08:35,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 13:08:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-11-27 13:08:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 13:08:35,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:35,229 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:35,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:35,433 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash -803819852, now seen corresponding path program 2 times [2019-11-27 13:08:35,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:35,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159543026] [2019-11-27 13:08:35,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:35,445 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:35,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316994864] [2019-11-27 13:08:35,447 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:35,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 13:08:35,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:08:35,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 13:08:35,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:35,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159543026] [2019-11-27 13:08:35,576 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:35,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316994864] [2019-11-27 13:08:35,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:35,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-27 13:08:35,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573046958] [2019-11-27 13:08:35,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 13:08:35,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 13:08:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:08:35,578 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 7 states. [2019-11-27 13:08:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:35,847 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-27 13:08:35,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 13:08:35,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-27 13:08:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:35,849 INFO L225 Difference]: With dead ends: 113 [2019-11-27 13:08:35,849 INFO L226 Difference]: Without dead ends: 111 [2019-11-27 13:08:35,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 13:08:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-27 13:08:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2019-11-27 13:08:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-27 13:08:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2019-11-27 13:08:35,859 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 31 [2019-11-27 13:08:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:35,860 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2019-11-27 13:08:35,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 13:08:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2019-11-27 13:08:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 13:08:35,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:35,861 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-27 13:08:36,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:36,065 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:36,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:36,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1656121185, now seen corresponding path program 3 times [2019-11-27 13:08:36,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:36,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523518098] [2019-11-27 13:08:36,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:36,074 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:36,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754407016] [2019-11-27 13:08:36,074 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:36,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 13:08:36,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:08:36,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-27 13:08:36,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:36,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:08:36,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523518098] [2019-11-27 13:08:36,482 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:36,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754407016] [2019-11-27 13:08:36,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:08:36,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-27 13:08:36,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386812620] [2019-11-27 13:08:36,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 13:08:36,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 13:08:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 13:08:36,484 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 9 states. [2019-11-27 13:08:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:36,866 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-11-27 13:08:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 13:08:36,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-11-27 13:08:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:36,868 INFO L225 Difference]: With dead ends: 115 [2019-11-27 13:08:36,869 INFO L226 Difference]: Without dead ends: 104 [2019-11-27 13:08:36,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-27 13:08:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-27 13:08:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-11-27 13:08:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-27 13:08:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-27 13:08:36,879 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 37 [2019-11-27 13:08:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:36,879 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-27 13:08:36,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 13:08:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-27 13:08:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 13:08:36,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:36,881 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:37,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:37,085 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1263094175, now seen corresponding path program 1 times [2019-11-27 13:08:37,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:37,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257932339] [2019-11-27 13:08:37,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:37,097 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:37,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778941274] [2019-11-27 13:08:37,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:08:37,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 13:08:37,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:37,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 13:08:37,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257932339] [2019-11-27 13:08:37,245 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:08:37,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778941274] [2019-11-27 13:08:37,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:08:37,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 13:08:37,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952725899] [2019-11-27 13:08:37,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:08:37,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:08:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:08:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:08:37,247 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-11-27 13:08:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:08:40,308 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2019-11-27 13:08:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:08:40,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-27 13:08:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:08:40,310 INFO L225 Difference]: With dead ends: 146 [2019-11-27 13:08:40,310 INFO L226 Difference]: Without dead ends: 103 [2019-11-27 13:08:40,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:08:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-27 13:08:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2019-11-27 13:08:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-27 13:08:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-27 13:08:40,320 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2019-11-27 13:08:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:08:40,320 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-27 13:08:40,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:08:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-27 13:08:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 13:08:40,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:08:40,321 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:08:40,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:40,525 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:08:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:08:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2081381013, now seen corresponding path program 4 times [2019-11-27 13:08:40,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 13:08:40,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425993867] [2019-11-27 13:08:40,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 13:08:40,533 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 13:08:40,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337923366] [2019-11-27 13:08:40,533 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:08:40,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 13:08:40,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 13:08:40,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-27 13:08:40,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:08:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:40,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:41,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:08:58,477 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-11-27 13:09:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:09:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:09:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425993867] [2019-11-27 13:09:09,265 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 13:09:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337923366] [2019-11-27 13:09:09,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 13:09:09,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-27 13:09:09,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637111387] [2019-11-27 13:09:09,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 13:09:09,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 13:09:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 13:09:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=144, Unknown=13, NotChecked=0, Total=210 [2019-11-27 13:09:09,269 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 15 states. [2019-11-27 13:09:29,236 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 18 [2019-11-27 13:09:52,434 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-27 13:10:33,989 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-27 13:10:51,366 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-27 13:10:51,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 13:10:51,569 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:161) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:714) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Broken pipe at java.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 31 more [2019-11-27 13:10:51,576 INFO L168 Benchmark]: Toolchain (without parser) took 141561.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 956.3 MB in the beginning and 823.0 MB in the end (delta: 133.3 MB). Peak memory consumption was 324.1 MB. Max. memory is 11.5 GB. [2019-11-27 13:10:51,576 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:10:51,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 13:10:51,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 13:10:51,578 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:10:51,579 INFO L168 Benchmark]: RCFGBuilder took 360.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-27 13:10:51,582 INFO L168 Benchmark]: TraceAbstraction took 140790.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 254.5 MB). Peak memory consumption was 332.1 MB. Max. memory is 11.5 GB. [2019-11-27 13:10:51,592 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.29 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 360.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140790.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 823.0 MB in the end (delta: 254.5 MB). Peak memory consumption was 332.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-de1bb10 [2019-11-27 13:10:53,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 13:10:53,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 13:10:53,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 13:10:53,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 13:10:53,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 13:10:53,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 13:10:53,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 13:10:53,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 13:10:53,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 13:10:53,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 13:10:53,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 13:10:53,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 13:10:53,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 13:10:53,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 13:10:53,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 13:10:53,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 13:10:53,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 13:10:53,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 13:10:53,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 13:10:53,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 13:10:53,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 13:10:53,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 13:10:53,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 13:10:53,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 13:10:53,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 13:10:53,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 13:10:53,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 13:10:53,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 13:10:53,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 13:10:53,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 13:10:53,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 13:10:53,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 13:10:53,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 13:10:53,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 13:10:53,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 13:10:53,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 13:10:53,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 13:10:53,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 13:10:53,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 13:10:53,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 13:10:53,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 13:10:53,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 13:10:53,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 13:10:53,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 13:10:53,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 13:10:53,493 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 13:10:53,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 13:10:53,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 13:10:53,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 13:10:53,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 13:10:53,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 13:10:53,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 13:10:53,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 13:10:53,495 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 13:10:53,496 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 13:10:53,496 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 13:10:53,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 13:10:53,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 13:10:53,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 13:10:53,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 13:10:53,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 13:10:53,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 13:10:53,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 13:10:53,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:10:53,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 13:10:53,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 13:10:53,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 13:10:53,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 13:10:53,502 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 13:10:53,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 13:10:53,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 13:10:53,503 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> e0f1c45558152fd199606f2551fe8da5ad92b45c [2019-11-27 13:10:53,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 13:10:53,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 13:10:53,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 13:10:53,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 13:10:53,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 13:10:53,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/hard.c [2019-11-27 13:10:53,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f602f5ccb/d018810970ba4e699aedc668c3b8b6aa/FLAG8df5720f3 [2019-11-27 13:10:54,379 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 13:10:54,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/hard.c [2019-11-27 13:10:54,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f602f5ccb/d018810970ba4e699aedc668c3b8b6aa/FLAG8df5720f3 [2019-11-27 13:10:54,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f602f5ccb/d018810970ba4e699aedc668c3b8b6aa [2019-11-27 13:10:54,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 13:10:54,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 13:10:54,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 13:10:54,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 13:10:54,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 13:10:54,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:10:54" (1/1) ... [2019-11-27 13:10:54,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c99d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:54, skipping insertion in model container [2019-11-27 13:10:54,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 01:10:54" (1/1) ... [2019-11-27 13:10:54,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 13:10:54,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 13:10:54,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:10:54,964 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 13:10:54,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 13:10:55,000 INFO L208 MainTranslator]: Completed translation [2019-11-27 13:10:55,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55 WrapperNode [2019-11-27 13:10:55,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 13:10:55,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 13:10:55,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 13:10:55,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 13:10:55,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 13:10:55,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 13:10:55,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 13:10:55,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 13:10:55,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... [2019-11-27 13:10:55,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 13:10:55,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 13:10:55,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 13:10:55,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 13:10:55,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 13:10:55,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 13:10:55,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 13:10:55,552 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 13:10:55,553 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-27 13:10:55,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:10:55 BoogieIcfgContainer [2019-11-27 13:10:55,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 13:10:55,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 13:10:55,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 13:10:55,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 13:10:55,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 01:10:54" (1/3) ... [2019-11-27 13:10:55,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c91ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:10:55, skipping insertion in model container [2019-11-27 13:10:55,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 01:10:55" (2/3) ... [2019-11-27 13:10:55,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c91ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 01:10:55, skipping insertion in model container [2019-11-27 13:10:55,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:10:55" (3/3) ... [2019-11-27 13:10:55,563 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-11-27 13:10:55,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 13:10:55,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-27 13:10:55,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-27 13:10:55,623 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 13:10:55,624 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 13:10:55,624 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 13:10:55,624 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 13:10:55,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 13:10:55,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 13:10:55,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 13:10:55,625 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 13:10:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-27 13:10:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 13:10:55,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:10:55,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 13:10:55,660 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:10:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:10:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 963340, now seen corresponding path program 1 times [2019-11-27 13:10:55,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:10:55,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525979255] [2019-11-27 13:10:55,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 13:10:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:10:55,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 13:10:55,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:10:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:55,772 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:10:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:55,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525979255] [2019-11-27 13:10:55,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:10:55,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 13:10:55,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713302866] [2019-11-27 13:10:55,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:10:55,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:10:55,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:10:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:10:55,820 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2019-11-27 13:10:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:10:56,085 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2019-11-27 13:10:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:10:56,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-11-27 13:10:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:10:56,097 INFO L225 Difference]: With dead ends: 92 [2019-11-27 13:10:56,098 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 13:10:56,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:10:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 13:10:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2019-11-27 13:10:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 13:10:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-27 13:10:56,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2019-11-27 13:10:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:10:56,160 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-27 13:10:56,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:10:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-27 13:10:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 13:10:56,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:10:56,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 13:10:56,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 13:10:56,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:10:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:10:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 925925231, now seen corresponding path program 1 times [2019-11-27 13:10:56,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:10:56,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70732939] [2019-11-27 13:10:56,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 13:10:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:10:56,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 13:10:56,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:10:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:56,415 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:10:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:56,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70732939] [2019-11-27 13:10:56,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:10:56,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 13:10:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528804518] [2019-11-27 13:10:56,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:10:56,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:10:56,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:10:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:10:56,429 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2019-11-27 13:10:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:10:56,656 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-27 13:10:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:10:56,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-27 13:10:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:10:56,658 INFO L225 Difference]: With dead ends: 49 [2019-11-27 13:10:56,659 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 13:10:56,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:10:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 13:10:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-27 13:10:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 13:10:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-27 13:10:56,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2019-11-27 13:10:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:10:56,678 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-27 13:10:56,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:10:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-27 13:10:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 13:10:56,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:10:56,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:10:56,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 13:10:56,897 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:10:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:10:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 756072562, now seen corresponding path program 1 times [2019-11-27 13:10:56,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:10:56,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287276020] [2019-11-27 13:10:56,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 13:10:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:10:56,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 13:10:56,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:10:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:57,004 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:10:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:10:57,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287276020] [2019-11-27 13:10:57,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:10:57,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-27 13:10:57,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972948275] [2019-11-27 13:10:57,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 13:10:57,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:10:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 13:10:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 13:10:57,105 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-11-27 13:10:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:10:59,877 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-27 13:10:59,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 13:10:59,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-11-27 13:10:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:10:59,887 INFO L225 Difference]: With dead ends: 93 [2019-11-27 13:10:59,887 INFO L226 Difference]: Without dead ends: 71 [2019-11-27 13:10:59,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-27 13:10:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-27 13:10:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-27 13:10:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-27 13:10:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-27 13:10:59,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 8 [2019-11-27 13:10:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:10:59,913 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-27 13:10:59,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 13:10:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-27 13:10:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 13:10:59,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:10:59,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:11:00,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 13:11:00,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:11:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:11:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107943, now seen corresponding path program 1 times [2019-11-27 13:11:00,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:11:00,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615502833] [2019-11-27 13:11:00,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 13:11:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:11:00,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 13:11:00,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:11:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:00,193 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:11:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:00,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615502833] [2019-11-27 13:11:00,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 13:11:00,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 13:11:00,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980141605] [2019-11-27 13:11:00,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 13:11:00,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:11:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 13:11:00,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 13:11:00,244 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2019-11-27 13:11:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:11:00,507 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-11-27 13:11:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 13:11:00,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-27 13:11:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:11:00,515 INFO L225 Difference]: With dead ends: 71 [2019-11-27 13:11:00,515 INFO L226 Difference]: Without dead ends: 60 [2019-11-27 13:11:00,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 13:11:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-27 13:11:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-27 13:11:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-27 13:11:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-27 13:11:00,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2019-11-27 13:11:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:11:00,533 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-27 13:11:00,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 13:11:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-27 13:11:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 13:11:00,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:11:00,534 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-27 13:11:00,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 13:11:00,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:11:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:11:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1654747054, now seen corresponding path program 1 times [2019-11-27 13:11:00,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:11:00,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640363105] [2019-11-27 13:11:00,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 13:11:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:11:00,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 13:11:00,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:11:00,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:11:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:00,930 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:11:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 2 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:03,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640363105] [2019-11-27 13:11:03,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:11:03,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-27 13:11:03,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371337002] [2019-11-27 13:11:03,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 13:11:03,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:11:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 13:11:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2019-11-27 13:11:03,333 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 10 states. [2019-11-27 13:11:07,187 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-27 13:11:09,511 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 14 [2019-11-27 13:11:11,869 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-27 13:11:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:11:15,917 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2019-11-27 13:11:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-27 13:11:15,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-27 13:11:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:11:15,922 INFO L225 Difference]: With dead ends: 114 [2019-11-27 13:11:15,922 INFO L226 Difference]: Without dead ends: 104 [2019-11-27 13:11:15,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=142, Invalid=277, Unknown=1, NotChecked=0, Total=420 [2019-11-27 13:11:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-27 13:11:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 64. [2019-11-27 13:11:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-27 13:11:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-27 13:11:15,940 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2019-11-27 13:11:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:11:15,940 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-27 13:11:15,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 13:11:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-27 13:11:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 13:11:15,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:11:15,942 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:11:16,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 13:11:16,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:11:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:11:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1585354123, now seen corresponding path program 1 times [2019-11-27 13:11:16,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:11:16,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591407319] [2019-11-27 13:11:16,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 13:11:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:11:16,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-27 13:11:16,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:11:16,844 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-27 13:11:17,293 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-11-27 13:11:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:11:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:17,679 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:11:18,891 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-27 13:11:20,352 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-27 13:11:22,119 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-27 13:11:24,374 WARN L192 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-11-27 13:11:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:11:24,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591407319] [2019-11-27 13:11:24,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:11:24,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-27 13:11:24,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808163345] [2019-11-27 13:11:24,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 13:11:24,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:11:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 13:11:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-27 13:11:24,383 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 14 states. [2019-11-27 13:11:27,650 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-27 13:11:28,805 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-27 13:11:29,610 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-27 13:11:31,002 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-27 13:11:35,591 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-27 13:11:43,022 WARN L192 SmtUtils]: Spent 869.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-27 13:11:50,717 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-27 13:11:57,980 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-27 13:12:03,269 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-27 13:12:09,251 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-27 13:12:11,937 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-27 13:12:23,366 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-27 13:12:25,994 WARN L192 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-27 13:12:28,853 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-27 13:12:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:12:31,521 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-11-27 13:12:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-27 13:12:31,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-27 13:12:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:12:31,540 INFO L225 Difference]: With dead ends: 136 [2019-11-27 13:12:31,540 INFO L226 Difference]: Without dead ends: 110 [2019-11-27 13:12:31,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2019-11-27 13:12:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-27 13:12:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-11-27 13:12:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 13:12:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-27 13:12:31,567 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 24 [2019-11-27 13:12:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:12:31,568 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-27 13:12:31,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 13:12:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-27 13:12:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 13:12:31,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:12:31,570 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:12:31,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 13:12:31,776 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:12:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:12:31,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1187920850, now seen corresponding path program 1 times [2019-11-27 13:12:31,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:12:31,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939632528] [2019-11-27 13:12:31,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 13:12:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:12:31,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 13:12:31,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:12:32,664 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-27 13:12:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:12:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:12:33,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:12:36,070 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-27 13:12:37,946 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-27 13:12:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:12:37,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939632528] [2019-11-27 13:12:37,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:12:37,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-27 13:12:37,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230054543] [2019-11-27 13:12:37,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 13:12:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:12:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 13:12:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-27 13:12:37,964 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 12 states. [2019-11-27 13:12:46,910 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-27 13:12:47,844 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-27 13:12:50,832 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-27 13:12:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:12:54,140 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-11-27 13:12:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 13:12:54,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-27 13:12:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:12:54,141 INFO L225 Difference]: With dead ends: 109 [2019-11-27 13:12:54,141 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 13:12:54,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-11-27 13:12:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 13:12:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2019-11-27 13:12:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-27 13:12:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-27 13:12:54,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2019-11-27 13:12:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:12:54,154 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-27 13:12:54,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 13:12:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-27 13:12:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 13:12:54,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:12:54,156 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:12:54,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 13:12:54,362 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:12:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:12:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1185426063, now seen corresponding path program 1 times [2019-11-27 13:12:54,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:12:54,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479511950] [2019-11-27 13:12:54,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 13:12:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 13:12:54,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-27 13:12:54,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 13:12:55,365 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-27 13:12:56,091 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-27 13:12:58,944 WARN L192 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-27 13:12:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:13:01,138 WARN L192 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-11-27 13:13:02,284 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-27 13:13:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:13:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:13:02,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 13:13:03,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:13:03,703 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-27 13:13:04,306 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-27 13:13:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 13:13:05,347 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-27 13:13:07,065 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-27 13:13:10,319 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-27 13:13:13,336 WARN L192 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-27 13:13:19,450 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-27 13:13:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 13:13:19,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479511950] [2019-11-27 13:13:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 13:13:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-11-27 13:13:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355586554] [2019-11-27 13:13:19,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 13:13:19,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 13:13:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 13:13:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-27 13:13:19,465 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 21 states. [2019-11-27 13:13:27,213 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-27 13:13:47,432 WARN L192 SmtUtils]: Spent 6.90 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-27 13:14:08,691 WARN L192 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-27 13:14:26,704 WARN L192 SmtUtils]: Spent 6.49 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-27 13:14:33,161 WARN L192 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-27 13:14:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 13:14:35,543 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-11-27 13:14:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 13:14:35,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-27 13:14:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 13:14:35,549 INFO L225 Difference]: With dead ends: 80 [2019-11-27 13:14:35,549 INFO L226 Difference]: Without dead ends: 65 [2019-11-27 13:14:35,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=270, Invalid=659, Unknown=1, NotChecked=0, Total=930 [2019-11-27 13:14:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-27 13:14:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-11-27 13:14:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-27 13:14:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-27 13:14:35,563 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 29 [2019-11-27 13:14:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 13:14:35,563 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-27 13:14:35,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 13:14:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-27 13:14:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 13:14:35,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 13:14:35,565 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 13:14:35,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 13:14:35,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 13:14:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 13:14:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash -803819852, now seen corresponding path program 2 times [2019-11-27 13:14:35,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 13:14:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933048173] [2019-11-27 13:14:35,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 13:14:35,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 13:14:35,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-27 13:14:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 13:14:36,023 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 13:14:36,023 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 13:14:36,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 13:14:36,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 01:14:36 BoogieIcfgContainer [2019-11-27 13:14:36,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 13:14:36,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 13:14:36,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 13:14:36,250 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 13:14:36,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 01:10:55" (3/4) ... [2019-11-27 13:14:36,252 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 13:14:36,303 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 13:14:36,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 13:14:36,305 INFO L168 Benchmark]: Toolchain (without parser) took 221564.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:14:36,305 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:14:36,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 13:14:36,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-27 13:14:36,307 INFO L168 Benchmark]: Boogie Preprocessor took 23.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 13:14:36,308 INFO L168 Benchmark]: RCFGBuilder took 424.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-27 13:14:36,308 INFO L168 Benchmark]: TraceAbstraction took 220693.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:14:36,309 INFO L168 Benchmark]: Witness Printer took 54.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 13:14:36,312 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.97 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 424.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220693.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 54.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int A, B; [L19] int r, d, p, q; [L20] A = __VERIFIER_nondet_int() [L21] B = __VERIFIER_nondet_int() [L24] r = A [L25] d = B [L26] p = 1 [L27] q = 0 [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND FALSE !(!(r >= d)) [L35] d = 2 * d [L36] p = 2 * p [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND FALSE !(!(r >= d)) [L35] d = 2 * d [L36] p = 2 * p [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND TRUE !(r >= d) [L39] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L43] COND FALSE !(!(p != 1)) [L45] d = d / 2 [L46] p = p / 2 [L47] COND TRUE r >= d [L48] r = r - d [L49] q = q + p [L39] COND TRUE 1 [L10] COND TRUE !(cond) [L12] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 7 error locations. Result: UNSAFE, OverallTime: 220.6s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 175.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 165 SDtfs, 538 SDslu, 512 SDs, 0 SdLazy, 916 SolverSat, 438 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 83.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 129.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 143 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 244 ConstructedInterpolants, 16 QuantifiedInterpolants, 110500 SizeOfPredicates, 51 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 10/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...