./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/loop-invgen/sendmail-close-angle.i -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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:02:17,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:02:17,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:02:17,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:02:17,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:02:17,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:02:17,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:02:17,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:02:17,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:02:17,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:02:17,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:02:17,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:02:17,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:02:17,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:02:17,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:02:17,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:02:17,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:02:17,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:02:17,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:02:17,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:02:17,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:02:17,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:02:17,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:02:17,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:02:17,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:02:17,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:02:17,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:02:17,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:02:17,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:02:17,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:02:17,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:02:17,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:02:17,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:02:17,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:02:17,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:02:17,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:02:17,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:02:17,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:02:17,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:02:17,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:02:17,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:02:17,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:02:17,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:02:17,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:02:17,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:02:17,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:02:17,802 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:02:17,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:02:17,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:02:17,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:02:17,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:02:17,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:02:17,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:02:17,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:02:17,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:02:17,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:02:17,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:02:17,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:02:17,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:02:17,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:02:17,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:02:17,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:02:17,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:02:17,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:02:17,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:02:17,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:02:17,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:02:17,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:02:17,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:02:17,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:02:17,810 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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-11-28 00:02:18,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:02:18,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:02:18,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:02:18,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:02:18,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:02:18,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-28 00:02:18,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121c8bb74/7af700e1127a4864be3b92a6444053d3/FLAG1c4fe0e7e [2019-11-28 00:02:18,668 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:02:18,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-28 00:02:18,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121c8bb74/7af700e1127a4864be3b92a6444053d3/FLAG1c4fe0e7e [2019-11-28 00:02:19,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121c8bb74/7af700e1127a4864be3b92a6444053d3 [2019-11-28 00:02:19,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:02:19,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:02:19,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:19,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:02:19,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:02:19,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19255d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19, skipping insertion in model container [2019-11-28 00:02:19,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:02:19,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:02:19,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:19,334 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:02:19,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:19,380 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:02:19,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19 WrapperNode [2019-11-28 00:02:19,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:19,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:19,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:02:19,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:02:19,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:19,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:02:19,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:02:19,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:02:19,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:02:19,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:02:19,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:02:19,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:02:19,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (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-28 00:02:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:02:19,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:02:19,894 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:02:19,894 INFO L297 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-28 00:02:19,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19 BoogieIcfgContainer [2019-11-28 00:02:19,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:02:19,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:02:19,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:02:19,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:02:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:02:19" (1/3) ... [2019-11-28 00:02:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b55ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:19, skipping insertion in model container [2019-11-28 00:02:19,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (2/3) ... [2019-11-28 00:02:19,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b55ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:19, skipping insertion in model container [2019-11-28 00:02:19,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19" (3/3) ... [2019-11-28 00:02:19,925 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-28 00:02:19,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:02:19,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 00:02:19,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 00:02:19,978 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:02:19,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:02:19,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:02:19,979 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:02:19,979 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:02:19,979 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:02:19,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:02:19,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:02:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-28 00:02:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:02:20,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,003 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1436471502, now seen corresponding path program 1 times [2019-11-28 00:02:20,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63597158] [2019-11-28 00:02:20,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,121 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-28 00:02:20,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63597158] [2019-11-28 00:02:20,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:02:20,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722887296] [2019-11-28 00:02:20,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:02:20,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:02:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:02:20,148 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-28 00:02:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,172 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-28 00:02:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:02:20,173 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 00:02:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,181 INFO L225 Difference]: With dead ends: 85 [2019-11-28 00:02:20,182 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 00:02:20,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:02:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 00:02:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 00:02:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 00:02:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-28 00:02:20,220 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 9 [2019-11-28 00:02:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,220 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-28 00:02:20,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:02:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-28 00:02:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:02:20,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1526631753, now seen corresponding path program 1 times [2019-11-28 00:02:20,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573500014] [2019-11-28 00:02:20,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,287 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-28 00:02:20,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573500014] [2019-11-28 00:02:20,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:20,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029909904] [2019-11-28 00:02:20,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:20,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:20,291 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-11-28 00:02:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,381 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-28 00:02:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:20,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 00:02:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,383 INFO L225 Difference]: With dead ends: 44 [2019-11-28 00:02:20,383 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:02:20,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 00:02:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:02:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-28 00:02:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:02:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 00:02:20,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2019-11-28 00:02:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,392 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 00:02:20,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 00:02:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:20,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1785542740, now seen corresponding path program 1 times [2019-11-28 00:02:20,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321067747] [2019-11-28 00:02:20,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,447 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-28 00:02:20,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321067747] [2019-11-28 00:02:20,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:20,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116252727] [2019-11-28 00:02:20,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:20,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:20,450 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-11-28 00:02:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,591 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-28 00:02:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:20,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 00:02:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,595 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:02:20,595 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 00:02:20,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:02:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 00:02:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-11-28 00:02:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:02:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-28 00:02:20,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-11-28 00:02:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,618 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-28 00:02:20,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-28 00:02:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:02:20,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,622 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash -734801565, now seen corresponding path program 1 times [2019-11-28 00:02:20,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871129309] [2019-11-28 00:02:20,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,722 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-28 00:02:20,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871129309] [2019-11-28 00:02:20,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:20,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191318555] [2019-11-28 00:02:20,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:20,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:20,728 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-28 00:02:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,791 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-28 00:02:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:20,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 00:02:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,793 INFO L225 Difference]: With dead ends: 44 [2019-11-28 00:02:20,793 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 00:02:20,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 00:02:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 00:02:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 00:02:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 00:02:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 00:02:20,802 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-11-28 00:02:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,802 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 00:02:20,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 00:02:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:02:20,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2090765742, now seen corresponding path program 1 times [2019-11-28 00:02:20,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105494950] [2019-11-28 00:02:20,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,898 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-28 00:02:20,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105494950] [2019-11-28 00:02:20,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:20,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214691009] [2019-11-28 00:02:20,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:20,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:20,902 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2019-11-28 00:02:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:21,121 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-28 00:02:21,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:02:21,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 00:02:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:21,124 INFO L225 Difference]: With dead ends: 71 [2019-11-28 00:02:21,124 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:02:21,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:02:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:02:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-28 00:02:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:02:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-28 00:02:21,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-11-28 00:02:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:21,148 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 00:02:21,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-28 00:02:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:02:21,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:21,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:21,150 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:21,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1769510362, now seen corresponding path program 1 times [2019-11-28 00:02:21,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:21,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753775013] [2019-11-28 00:02:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,267 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-28 00:02:21,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753775013] [2019-11-28 00:02:21,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:02:21,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208298548] [2019-11-28 00:02:21,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:02:21,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:02:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:21,271 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2019-11-28 00:02:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:21,455 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-28 00:02:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:02:21,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 00:02:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:21,457 INFO L225 Difference]: With dead ends: 63 [2019-11-28 00:02:21,458 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 00:02:21,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 00:02:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-28 00:02:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:02:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-28 00:02:21,467 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2019-11-28 00:02:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:21,468 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-28 00:02:21,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:02:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-28 00:02:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:02:21,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:21,469 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:21,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1110583474, now seen corresponding path program 1 times [2019-11-28 00:02:21,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:21,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834721326] [2019-11-28 00:02:21,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:21,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834721326] [2019-11-28 00:02:21,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459191347] [2019-11-28 00:02:21,604 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-28 00:02:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 00:02:21,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:21,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:21,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-28 00:02:21,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137780896] [2019-11-28 00:02:21,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:02:21,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:21,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:02:21,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:02:21,851 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2019-11-28 00:02:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:22,809 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-28 00:02:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 00:02:22,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-28 00:02:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:22,812 INFO L225 Difference]: With dead ends: 121 [2019-11-28 00:02:22,813 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 00:02:22,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1042, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 00:02:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 00:02:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2019-11-28 00:02:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 00:02:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-28 00:02:22,827 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-28 00:02:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:22,827 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-28 00:02:22,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:02:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-28 00:02:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:02:22,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:22,829 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:23,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:23,056 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1311932474, now seen corresponding path program 1 times [2019-11-28 00:02:23,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:23,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320714474] [2019-11-28 00:02:23,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,168 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-28 00:02:23,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320714474] [2019-11-28 00:02:23,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140412939] [2019-11-28 00:02:23,169 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-28 00:02:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 00:02:23,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:23,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:23,265 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-28 00:02:23,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:23,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 00:02:23,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548222011] [2019-11-28 00:02:23,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:02:23,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:02:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:02:23,267 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2019-11-28 00:02:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:23,457 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-28 00:02:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:02:23,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-28 00:02:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:23,459 INFO L225 Difference]: With dead ends: 77 [2019-11-28 00:02:23,459 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 00:02:23,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:02:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 00:02:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-28 00:02:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 00:02:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-28 00:02:23,471 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2019-11-28 00:02:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:23,471 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-28 00:02:23,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:02:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-28 00:02:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:02:23,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:23,473 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:23,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:23,678 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1348445734, now seen corresponding path program 2 times [2019-11-28 00:02:23,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:23,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449074508] [2019-11-28 00:02:23,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:23,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449074508] [2019-11-28 00:02:23,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534282895] [2019-11-28 00:02:23,837 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 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-28 00:02:23,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:02:23,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:23,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:02:23,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:24,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:24,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:24,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:24,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-11-28 00:02:24,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615352131] [2019-11-28 00:02:24,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:02:24,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:02:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:02:24,127 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 22 states. [2019-11-28 00:02:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:25,186 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-11-28 00:02:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:02:25,186 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-11-28 00:02:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:25,187 INFO L225 Difference]: With dead ends: 99 [2019-11-28 00:02:25,188 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 00:02:25,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=1476, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 00:02:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 00:02:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2019-11-28 00:02:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 00:02:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-28 00:02:25,198 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2019-11-28 00:02:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:25,198 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-28 00:02:25,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:02:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-28 00:02:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 00:02:25,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:25,200 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:25,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:25,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash 670000306, now seen corresponding path program 2 times [2019-11-28 00:02:25,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:25,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166641838] [2019-11-28 00:02:25,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:02:25,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166641838] [2019-11-28 00:02:25,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996712473] [2019-11-28 00:02:25,577 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-28 00:02:25,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:02:25,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:25,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 00:02:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:25,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:25,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:25,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:25,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-28 00:02:25,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094144496] [2019-11-28 00:02:25,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:02:25,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:02:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:02:25,905 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 19 states. [2019-11-28 00:02:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:26,555 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-28 00:02:26,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:02:26,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-11-28 00:02:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:26,557 INFO L225 Difference]: With dead ends: 75 [2019-11-28 00:02:26,557 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:02:26,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:02:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:02:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-11-28 00:02:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 00:02:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-28 00:02:26,566 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-11-28 00:02:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:26,566 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-28 00:02:26,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:02:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-28 00:02:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:02:26,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:26,568 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:26,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:26,781 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2085108794, now seen corresponding path program 3 times [2019-11-28 00:02:26,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:26,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066658179] [2019-11-28 00:02:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:02:27,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066658179] [2019-11-28 00:02:27,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693749028] [2019-11-28 00:02:27,015 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 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-28 00:02:27,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:02:27,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:27,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:02:27,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:27,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:27,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-11-28 00:02:27,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746959931] [2019-11-28 00:02:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:02:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:02:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:02:27,318 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states. [2019-11-28 00:02:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:29,349 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-28 00:02:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 00:02:29,350 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-11-28 00:02:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:29,351 INFO L225 Difference]: With dead ends: 70 [2019-11-28 00:02:29,351 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:29,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2019-11-28 00:02:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:29,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-28 00:02:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:29,372 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:29,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:02:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:29,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:29,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:29,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:30,048 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-11-28 00:02:30,233 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-11-28 00:02:30,416 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-28 00:02:30,647 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-11-28 00:02:30,650 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,650 INFO L246 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-28 00:02:30,650 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,651 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:30,651 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:30,651 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,651 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-28 00:02:30,651 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,652 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-28 00:02:30,652 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,652 INFO L242 CegarLoopResult]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse0 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse1 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse0 .cse1) (and (<= ULTIMATE.start_main_~buf~0 1) .cse2 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse0 .cse1) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse2 .cse3 .cse0 .cse1))) [2019-11-28 00:02:30,652 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,652 INFO L242 CegarLoopResult]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3))) [2019-11-28 00:02:30,653 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,653 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,653 INFO L242 CegarLoopResult]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 00:02:30,653 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,653 INFO L242 CegarLoopResult]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 00:02:30,653 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,653 INFO L242 CegarLoopResult]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 00:02:30,653 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:30,653 INFO L249 CegarLoopResult]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-28 00:02:30,654 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L249 CegarLoopResult]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-28 00:02:30,655 INFO L249 CegarLoopResult]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,655 INFO L246 CegarLoopResult]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-28 00:02:30,656 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 00:02:30,656 INFO L246 CegarLoopResult]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-28 00:02:30,656 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:30,656 INFO L246 CegarLoopResult]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-28 00:02:30,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:30 BoogieIcfgContainer [2019-11-28 00:02:30,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:30,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:30,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:30,704 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:30,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19" (3/4) ... [2019-11-28 00:02:30,710 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:30,730 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-28 00:02:30,731 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:30,802 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:30,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:30,806 INFO L168 Benchmark]: Toolchain (without parser) took 11770.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,808 INFO L168 Benchmark]: CDTParser took 0.29 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-28 00:02:30,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,810 INFO L168 Benchmark]: Boogie Preprocessor took 26.68 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,812 INFO L168 Benchmark]: RCFGBuilder took 392.42 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,815 INFO L168 Benchmark]: TraceAbstraction took 10806.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,816 INFO L168 Benchmark]: Witness Printer took 98.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:30,822 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.08 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 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 94.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.68 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.42 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10806.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. * Witness Printer took 98.36 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((3 <= buf && bufferlen + 1 <= inlen) && !(0 == cond)) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim)) || ((((in == 0 && 0 == buf) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 8 error locations. Result: SAFE, OverallTime: 9.6s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 329 SDtfs, 1146 SDslu, 1123 SDs, 0 SdLazy, 1556 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 51 NumberOfFragments, 423 HoareAnnotationTreeSize, 10 FomulaSimplifications, 8352 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1014 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 122483 SizeOfPredicates, 41 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 41/302 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 correct! Received shutdown request...