./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/eca-rers2012/Problem01_label40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2268b9dd6959c9e4f82beab56974646f066475d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:43:42,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:42,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:42,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:42,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:42,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:42,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:42,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:42,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:42,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:42,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:42,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:42,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:42,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:42,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:42,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:42,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:42,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:42,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:42,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:42,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:42,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:42,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:42,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:42,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:42,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:42,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:42,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:42,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:42,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:42,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:42,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:42,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:42,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:42,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:42,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:42,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:42,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:42,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:42,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:42,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:42,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:43:42,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:42,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:42,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:42,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:42,930 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:42,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:42,930 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:42,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:42,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:42,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:42,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:42,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:42,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:42,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:42,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:42,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:42,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:42,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:42,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:42,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:42,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:42,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:42,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:42,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:42,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:42,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:42,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:42,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:42,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:42,935 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 -> d2268b9dd6959c9e4f82beab56974646f066475d [2019-11-28 15:43:43,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:43,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:43,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:43,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:43,284 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:43,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-28 15:43:43,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16743ccfe/7eb5694240964ff589c56493eadfb595/FLAGd2f535e00 [2019-11-28 15:43:43,879 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:43,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label40.c [2019-11-28 15:43:43,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16743ccfe/7eb5694240964ff589c56493eadfb595/FLAGd2f535e00 [2019-11-28 15:43:44,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16743ccfe/7eb5694240964ff589c56493eadfb595 [2019-11-28 15:43:44,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:44,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:44,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:44,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:44,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:44,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:44,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463e911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44, skipping insertion in model container [2019-11-28 15:43:44,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:44,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:44,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:44,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:44,850 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:44,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:44,984 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:44,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44 WrapperNode [2019-11-28 15:43:44,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:44,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:44,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:44,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:44,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:45,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:45,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:45,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:45,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (1/1) ... [2019-11-28 15:43:45,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:45,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:45,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:45,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:45,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (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 15:43:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:45,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:46,607 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:46,608 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:46,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:46 BoogieIcfgContainer [2019-11-28 15:43:46,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:46,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:46,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:46,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:46,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:44" (1/3) ... [2019-11-28 15:43:46,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c5c4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:46, skipping insertion in model container [2019-11-28 15:43:46,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:44" (2/3) ... [2019-11-28 15:43:46,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c5c4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:46, skipping insertion in model container [2019-11-28 15:43:46,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:46" (3/3) ... [2019-11-28 15:43:46,620 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label40.c [2019-11-28 15:43:46,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:46,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:46,655 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:46,684 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:46,684 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:46,684 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:46,685 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:46,685 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:46,685 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:46,685 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:46,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 15:43:46,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:46,721 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:46,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 304749070, now seen corresponding path program 1 times [2019-11-28 15:43:46,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:46,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082819011] [2019-11-28 15:43:46,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:47,275 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 15:43:47,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082819011] [2019-11-28 15:43:47,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:47,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:47,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988482133] [2019-11-28 15:43:47,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:47,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:47,310 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-28 15:43:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:48,676 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-28 15:43:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:48,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-28 15:43:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:48,696 INFO L225 Difference]: With dead ends: 662 [2019-11-28 15:43:48,696 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 15:43:48,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 15:43:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-28 15:43:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:43:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-28 15:43:48,789 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 87 [2019-11-28 15:43:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:48,791 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-28 15:43:48,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-28 15:43:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 15:43:48,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:48,805 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:48,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2087983333, now seen corresponding path program 1 times [2019-11-28 15:43:48,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:48,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741098613] [2019-11-28 15:43:48,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:48,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741098613] [2019-11-28 15:43:48,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:48,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:48,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322242080] [2019-11-28 15:43:48,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:48,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:48,910 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-28 15:43:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:49,788 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-28 15:43:49,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:49,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-28 15:43:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:49,795 INFO L225 Difference]: With dead ends: 1054 [2019-11-28 15:43:49,795 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:49,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:43:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-28 15:43:49,843 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 93 [2019-11-28 15:43:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:49,843 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-28 15:43:49,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-28 15:43:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-28 15:43:49,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:49,847 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:49,847 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash 743115340, now seen corresponding path program 1 times [2019-11-28 15:43:49,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:49,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505217170] [2019-11-28 15:43:49,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:43:49,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505217170] [2019-11-28 15:43:49,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:49,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:49,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957502959] [2019-11-28 15:43:49,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:49,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:49,976 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-28 15:43:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:50,509 INFO L93 Difference]: Finished difference Result 1840 states and 2519 transitions. [2019-11-28 15:43:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-28 15:43:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:50,516 INFO L225 Difference]: With dead ends: 1840 [2019-11-28 15:43:50,516 INFO L226 Difference]: Without dead ends: 1052 [2019-11-28 15:43:50,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-28 15:43:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2019-11-28 15:43:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-28 15:43:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-28 15:43:50,549 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 113 [2019-11-28 15:43:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-28 15:43:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-28 15:43:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-28 15:43:50,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:50,553 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:50,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash -629030967, now seen corresponding path program 1 times [2019-11-28 15:43:50,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:50,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299257914] [2019-11-28 15:43:50,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-28 15:43:50,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299257914] [2019-11-28 15:43:50,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:50,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:50,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281554944] [2019-11-28 15:43:50,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:50,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:50,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:50,646 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-28 15:43:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:51,255 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-28 15:43:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:51,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-28 15:43:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:51,264 INFO L225 Difference]: With dead ends: 2233 [2019-11-28 15:43:51,264 INFO L226 Difference]: Without dead ends: 1314 [2019-11-28 15:43:51,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-28 15:43:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-28 15:43:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-28 15:43:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-28 15:43:51,297 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 149 [2019-11-28 15:43:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:51,297 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-28 15:43:51,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-28 15:43:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-28 15:43:51,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:51,302 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:51,302 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 709799897, now seen corresponding path program 1 times [2019-11-28 15:43:51,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:51,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722578649] [2019-11-28 15:43:51,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-28 15:43:51,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722578649] [2019-11-28 15:43:51,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:51,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:51,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965224913] [2019-11-28 15:43:51,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:51,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:51,399 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-28 15:43:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:51,869 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-28 15:43:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:51,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-28 15:43:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:51,880 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:51,880 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:51,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-28 15:43:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-11-28 15:43:51,931 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 168 [2019-11-28 15:43:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:51,931 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-11-28 15:43:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-11-28 15:43:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-28 15:43:51,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:51,936 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:51,937 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1199428114, now seen corresponding path program 1 times [2019-11-28 15:43:51,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:51,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566673413] [2019-11-28 15:43:51,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-28 15:43:52,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566673413] [2019-11-28 15:43:52,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:52,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:52,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357996074] [2019-11-28 15:43:52,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:52,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:52,027 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-11-28 15:43:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:52,454 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-11-28 15:43:52,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:52,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-28 15:43:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:52,463 INFO L225 Difference]: With dead ends: 3412 [2019-11-28 15:43:52,463 INFO L226 Difference]: Without dead ends: 1838 [2019-11-28 15:43:52,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-28 15:43:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-28 15:43:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-11-28 15:43:52,505 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 171 [2019-11-28 15:43:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:52,505 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-11-28 15:43:52,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-11-28 15:43:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-28 15:43:52,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:52,510 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:52,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 388122842, now seen corresponding path program 1 times [2019-11-28 15:43:52,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:52,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172504347] [2019-11-28 15:43:52,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-28 15:43:52,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172504347] [2019-11-28 15:43:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:52,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 15:43:52,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791575865] [2019-11-28 15:43:52,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:43:52,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:43:52,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:43:52,721 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-11-28 15:43:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:54,015 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-11-28 15:43:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:43:54,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-11-28 15:43:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:54,025 INFO L225 Difference]: With dead ends: 3841 [2019-11-28 15:43:54,025 INFO L226 Difference]: Without dead ends: 2005 [2019-11-28 15:43:54,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:43:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-28 15:43:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-11-28 15:43:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-11-28 15:43:54,069 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 175 [2019-11-28 15:43:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:54,070 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-11-28 15:43:54,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:43:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-11-28 15:43:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-28 15:43:54,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:54,076 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:54,077 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2034265206, now seen corresponding path program 1 times [2019-11-28 15:43:54,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:54,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372659080] [2019-11-28 15:43:54,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-28 15:43:54,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372659080] [2019-11-28 15:43:54,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:54,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:54,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873383231] [2019-11-28 15:43:54,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:54,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:54,249 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-11-28 15:43:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:55,095 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-11-28 15:43:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:55,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-28 15:43:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:55,106 INFO L225 Difference]: With dead ends: 3936 [2019-11-28 15:43:55,106 INFO L226 Difference]: Without dead ends: 2100 [2019-11-28 15:43:55,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-28 15:43:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-28 15:43:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-11-28 15:43:55,148 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 208 [2019-11-28 15:43:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:55,149 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-11-28 15:43:55,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-11-28 15:43:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-28 15:43:55,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:55,155 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:55,155 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1088708010, now seen corresponding path program 1 times [2019-11-28 15:43:55,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:55,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392484367] [2019-11-28 15:43:55,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 15:43:55,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392484367] [2019-11-28 15:43:55,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:55,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:55,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571733467] [2019-11-28 15:43:55,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:55,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:55,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:55,301 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-11-28 15:43:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:55,956 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-11-28 15:43:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:55,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-28 15:43:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:55,965 INFO L225 Difference]: With dead ends: 4460 [2019-11-28 15:43:55,965 INFO L226 Difference]: Without dead ends: 2493 [2019-11-28 15:43:55,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-28 15:43:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-28 15:43:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-28 15:43:56,012 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 234 [2019-11-28 15:43:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:56,013 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-28 15:43:56,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-28 15:43:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-28 15:43:56,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:56,020 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:43:56,020 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 217822603, now seen corresponding path program 1 times [2019-11-28 15:43:56,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:56,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241427694] [2019-11-28 15:43:56,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-28 15:43:56,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241427694] [2019-11-28 15:43:56,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:56,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:43:56,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717381253] [2019-11-28 15:43:56,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:43:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:43:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:56,194 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-28 15:43:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:57,079 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-28 15:43:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:57,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-11-28 15:43:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:57,091 INFO L225 Difference]: With dead ends: 4105 [2019-11-28 15:43:57,091 INFO L226 Difference]: Without dead ends: 2138 [2019-11-28 15:43:57,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-28 15:43:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-28 15:43:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-28 15:43:57,128 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 255 [2019-11-28 15:43:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:57,129 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-28 15:43:57,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:43:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-28 15:43:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-28 15:43:57,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:57,136 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:57,136 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1273151060, now seen corresponding path program 1 times [2019-11-28 15:43:57,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:57,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761091636] [2019-11-28 15:43:57,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-28 15:43:58,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761091636] [2019-11-28 15:43:58,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237011074] [2019-11-28 15:43:58,340 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 15:43:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:58,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:43:58,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:43:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-28 15:43:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:43:58,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-28 15:43:58,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583364134] [2019-11-28 15:43:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:58,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-28 15:43:58,701 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-28 15:43:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:59,364 INFO L93 Difference]: Finished difference Result 4196 states and 4779 transitions. [2019-11-28 15:43:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:59,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-28 15:43:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:59,367 INFO L225 Difference]: With dead ends: 4196 [2019-11-28 15:43:59,367 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:59,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-28 15:43:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:59,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 277 [2019-11-28 15:43:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:59,372 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:59,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:59,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:59,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:59,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:59,821 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 82 [2019-11-28 15:44:00,034 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2019-11-28 15:44:00,406 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-11-28 15:44:00,696 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-11-28 15:44:00,699 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:44:00,699 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:44:00,700 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:44:00,701 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:44:00,701 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:44:00,701 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:44:00,701 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,702 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:44:00,703 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:44:00,704 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,705 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,706 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,706 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,706 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,706 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:44:00,706 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:44:00,707 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:44:00,708 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:44:00,708 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a16~0 6)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a17~0 1)) (.cse1 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse5 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 (<= ~a17~0 0)) (and (not .cse2) .cse3 .cse4) (and .cse0 .cse2) (and .cse3 .cse4 (= ~a20~0 1)) (and .cse4 .cse2 .cse5) (and .cse0 .cse3) (and .cse1 .cse4) (and .cse4 .cse5 (= ~a16~0 5)))) [2019-11-28 15:44:00,708 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:44:00,709 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:44:00,710 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:44:00,710 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:44:00,710 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:44:00,710 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:44:00,710 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:44:00,711 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:44:00,712 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:44:00,712 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,712 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,712 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,712 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,712 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,713 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:44:00,713 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:44:00,713 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:44:00,713 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:44:00,713 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,714 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:44:00,715 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:44:00,716 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:44:00,717 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,718 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a16~0 6)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a17~0 1)) (.cse1 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse5 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 (<= ~a17~0 0)) (and (not .cse2) .cse3 .cse4) (and .cse0 .cse2) (and .cse3 .cse4 (= ~a20~0 1)) (and .cse4 .cse2 .cse5) (and .cse0 .cse3) (and .cse1 .cse4) (and .cse4 .cse5 (= ~a16~0 5)))) [2019-11-28 15:44:00,718 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,718 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,718 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:44:00,719 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,720 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,721 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,721 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,721 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:44:00,721 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:44:00,721 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:44:00,722 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,723 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:44:00,724 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:44:00,725 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,726 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:44:00,727 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:44:00,728 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:44:00,729 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,730 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:44:00,731 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:44:00,732 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:44:00,732 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:44:00,732 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:44:00,732 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:44:00,732 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:44:00,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:44:00 BoogieIcfgContainer [2019-11-28 15:44:00,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:44:00,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:44:00,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:44:00,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:44:00,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:46" (3/4) ... [2019-11-28 15:44:00,767 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:44:00,804 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:44:00,806 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:44:01,003 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:44:01,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:44:01,004 INFO L168 Benchmark]: Toolchain (without parser) took 16829.22 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 430.4 MB). Free memory was 956.3 MB in the beginning and 903.3 MB in the end (delta: 53.0 MB). Peak memory consumption was 483.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,005 INFO L168 Benchmark]: CDTParser took 0.36 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 15:44:01,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,006 INFO L168 Benchmark]: Boogie Preprocessor took 102.82 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,006 INFO L168 Benchmark]: RCFGBuilder took 1414.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,007 INFO L168 Benchmark]: TraceAbstraction took 14147.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 285.2 MB). Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 73.4 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,007 INFO L168 Benchmark]: Witness Printer took 241.15 ms. Allocated memory is still 1.5 GB. Free memory was 927.2 MB in the beginning and 903.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:01,010 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.36 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 808.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.82 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1414.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14147.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 285.2 MB). Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 73.4 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. * Witness Printer took 241.15 ms. Allocated memory is still 1.5 GB. Free memory was 927.2 MB in the beginning and 903.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a16 == 4) && a17 <= 0) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || (1 == a7 && a16 == 6)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a16 == 6) && !(13 == a8))) || (1 == a7 && a17 == 1)) || (a16 == 4 && a21 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a16 == 4) && a17 <= 0) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || (1 == a7 && a16 == 6)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a16 == 6) && !(13 == a8))) || (1 == a7 && a17 == 1)) || (a16 == 4 && a21 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.9s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 916 SDtfs, 2467 SDslu, 123 SDs, 0 SdLazy, 5865 SolverSat, 1047 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 295 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 151 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15482 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4706 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2207 NumberOfCodeBlocks, 2207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1591827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2712/2720 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...