./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.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 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:51:21,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:51:21,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:51:21,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:51:21,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:51:21,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:51:21,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:51:21,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:51:21,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:51:21,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:51:21,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:51:21,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:51:21,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:51:21,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:51:21,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:51:21,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:51:21,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:51:21,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:51:21,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:51:21,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:51:21,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:51:21,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:51:21,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:51:21,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:51:21,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:51:21,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:51:21,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:51:21,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:51:21,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:51:21,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:51:21,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:51:21,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:51:21,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:51:21,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:51:21,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:51:21,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:51:21,382 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:51:21,401 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:51:21,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:51:21,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:51:21,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:51:21,403 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:51:21,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:51:21,403 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:51:21,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:51:21,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:51:21,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:51:21,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:51:21,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:51:21,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:51:21,405 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:51:21,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:51:21,405 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:51:21,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:51:21,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:51:21,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:51:21,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:51:21,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:51:21,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:51:21,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:51:21,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:51:21,407 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:51:21,407 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:51:21,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:51:21,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:51:21,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 [2019-01-12 00:51:21,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:51:21,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:51:21,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:51:21,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:51:21,473 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:51:21,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c [2019-01-12 00:51:21,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb2d1d9f/1da8b28050bc460eb8711c3e46b02a54/FLAGe4bb323da [2019-01-12 00:51:22,158 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:51:22,158 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label13_true-unreach-call_false-termination.c [2019-01-12 00:51:22,178 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb2d1d9f/1da8b28050bc460eb8711c3e46b02a54/FLAGe4bb323da [2019-01-12 00:51:22,392 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb2d1d9f/1da8b28050bc460eb8711c3e46b02a54 [2019-01-12 00:51:22,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:51:22,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:51:22,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:51:22,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:51:22,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:51:22,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:51:22" (1/1) ... [2019-01-12 00:51:22,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:22, skipping insertion in model container [2019-01-12 00:51:22,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:51:22" (1/1) ... [2019-01-12 00:51:22,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:51:22,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:51:22,865 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:51:22,870 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:51:22,992 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:51:23,012 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:51:23,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23 WrapperNode [2019-01-12 00:51:23,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:51:23,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:51:23,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:51:23,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:51:23,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:51:23,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:51:23,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:51:23,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:51:23,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (1/1) ... [2019-01-12 00:51:23,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:51:23,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:51:23,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:51:23,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:51:23,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (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-01-12 00:51:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:51:23,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:51:26,596 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:51:26,596 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:51:26,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:26 BoogieIcfgContainer [2019-01-12 00:51:26,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:51:26,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:51:26,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:51:26,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:51:26,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:51:22" (1/3) ... [2019-01-12 00:51:26,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:51:26, skipping insertion in model container [2019-01-12 00:51:26,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:51:23" (2/3) ... [2019-01-12 00:51:26,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:51:26, skipping insertion in model container [2019-01-12 00:51:26,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:26" (3/3) ... [2019-01-12 00:51:26,607 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label13_true-unreach-call_false-termination.c [2019-01-12 00:51:26,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:51:26,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:51:26,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:51:26,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:51:26,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:51:26,675 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:51:26,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:51:26,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:51:26,676 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:51:26,676 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:51:26,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:51:26,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:51:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:51:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 00:51:26,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:26,715 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:26,718 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1419855070, now seen corresponding path program 1 times [2019-01-12 00:51:26,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:26,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:26,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:27,330 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:51:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:27,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:27,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:51:27,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:27,406 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:51:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:29,842 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:51:29,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:51:29,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-01-12 00:51:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:29,863 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:51:29,863 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:51:29,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:51:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:51:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:51:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-01-12 00:51:29,939 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 123 [2019-01-12 00:51:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:29,940 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-01-12 00:51:29,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-01-12 00:51:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 00:51:29,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:29,946 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:29,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1345449990, now seen corresponding path program 1 times [2019-01-12 00:51:29,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:29,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:29,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:51:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:30,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:51:30,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:30,123 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-01-12 00:51:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:31,544 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-01-12 00:51:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:31,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-01-12 00:51:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:31,550 INFO L225 Difference]: With dead ends: 1185 [2019-01-12 00:51:31,550 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:51:31,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:51:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:51:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:51:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-01-12 00:51:31,595 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 128 [2019-01-12 00:51:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:31,596 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-01-12 00:51:31,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-01-12 00:51:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 00:51:31,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:31,601 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:31,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash -139497956, now seen corresponding path program 1 times [2019-01-12 00:51:31,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:51:31,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:31,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:51:31,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:51:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:51:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:51:31,729 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-01-12 00:51:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:33,071 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-01-12 00:51:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:33,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-12 00:51:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:33,082 INFO L225 Difference]: With dead ends: 1971 [2019-01-12 00:51:33,082 INFO L226 Difference]: Without dead ends: 1183 [2019-01-12 00:51:33,084 INFO L631 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-01-12 00:51:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-01-12 00:51:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-01-12 00:51:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-12 00:51:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-01-12 00:51:33,136 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 149 [2019-01-12 00:51:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-01-12 00:51:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:51:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-01-12 00:51:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-12 00:51:33,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:33,143 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:33,143 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:33,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2073958119, now seen corresponding path program 1 times [2019-01-12 00:51:33,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:33,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:33,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:33,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-12 00:51:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:51:33,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:51:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:51:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:51:33,374 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-01-12 00:51:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:35,053 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-01-12 00:51:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:35,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-01-12 00:51:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:35,061 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:51:35,061 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 00:51:35,062 INFO L631 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-01-12 00:51:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 00:51:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-01-12 00:51:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:51:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1526 transitions. [2019-01-12 00:51:35,093 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1526 transitions. Word has length 185 [2019-01-12 00:51:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:35,094 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1526 transitions. [2019-01-12 00:51:35,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:51:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1526 transitions. [2019-01-12 00:51:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 00:51:35,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:35,099 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:35,099 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 146303237, now seen corresponding path program 1 times [2019-01-12 00:51:35,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:35,284 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:51:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:51:35,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:35,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:51:35,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:35,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:35,334 INFO L87 Difference]: Start difference. First operand 1183 states and 1526 transitions. Second operand 4 states. [2019-01-12 00:51:36,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:36,004 INFO L93 Difference]: Finished difference Result 2500 states and 3204 transitions. [2019-01-12 00:51:36,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:51:36,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-01-12 00:51:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:36,012 INFO L225 Difference]: With dead ends: 2500 [2019-01-12 00:51:36,012 INFO L226 Difference]: Without dead ends: 1319 [2019-01-12 00:51:36,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:51:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-01-12 00:51:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-01-12 00:51:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-01-12 00:51:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1663 transitions. [2019-01-12 00:51:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1663 transitions. Word has length 193 [2019-01-12 00:51:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:36,044 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1663 transitions. [2019-01-12 00:51:36,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1663 transitions. [2019-01-12 00:51:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 00:51:36,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:36,052 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:36,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1732240947, now seen corresponding path program 1 times [2019-01-12 00:51:36,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:36,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:36,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:36,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:51:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:36,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:51:36,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:51:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:51:36,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:51:36,224 INFO L87 Difference]: Start difference. First operand 1314 states and 1663 transitions. Second operand 5 states. [2019-01-12 00:51:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:37,534 INFO L93 Difference]: Finished difference Result 2757 states and 3527 transitions. [2019-01-12 00:51:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:51:37,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2019-01-12 00:51:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:37,544 INFO L225 Difference]: With dead ends: 2757 [2019-01-12 00:51:37,544 INFO L226 Difference]: Without dead ends: 1576 [2019-01-12 00:51:37,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:51:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-01-12 00:51:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-01-12 00:51:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:51:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1949 transitions. [2019-01-12 00:51:37,583 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1949 transitions. Word has length 197 [2019-01-12 00:51:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:37,584 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1949 transitions. [2019-01-12 00:51:37,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:51:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1949 transitions. [2019-01-12 00:51:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-12 00:51:37,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:37,591 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:37,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -794045742, now seen corresponding path program 1 times [2019-01-12 00:51:37,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:37,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 00:51:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:51:37,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:51:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:51:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:51:37,749 INFO L87 Difference]: Start difference. First operand 1576 states and 1949 transitions. Second operand 3 states. [2019-01-12 00:51:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:38,276 INFO L93 Difference]: Finished difference Result 3412 states and 4236 transitions. [2019-01-12 00:51:38,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-01-12 00:51:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:38,285 INFO L225 Difference]: With dead ends: 3412 [2019-01-12 00:51:38,285 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:51:38,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-12 00:51:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:51:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-01-12 00:51:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:51:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1732 transitions. [2019-01-12 00:51:38,331 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1732 transitions. Word has length 200 [2019-01-12 00:51:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:38,332 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1732 transitions. [2019-01-12 00:51:38,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:51:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1732 transitions. [2019-01-12 00:51:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-12 00:51:38,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:38,340 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:51:38,340 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash 933247694, now seen corresponding path program 1 times [2019-01-12 00:51:38,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:38,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:38,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:38,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:38,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-12 00:51:38,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:38,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:51:38,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:51:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:51:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:51:38,533 INFO L87 Difference]: Start difference. First operand 1576 states and 1732 transitions. Second operand 3 states. [2019-01-12 00:51:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:39,285 INFO L93 Difference]: Finished difference Result 3543 states and 3930 transitions. [2019-01-12 00:51:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:39,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-01-12 00:51:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:39,294 INFO L225 Difference]: With dead ends: 3543 [2019-01-12 00:51:39,294 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:51:39,297 INFO L631 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-01-12 00:51:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:51:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-01-12 00:51:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:51:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2004 transitions. [2019-01-12 00:51:39,330 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2004 transitions. Word has length 215 [2019-01-12 00:51:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:39,331 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2004 transitions. [2019-01-12 00:51:39,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:51:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2004 transitions. [2019-01-12 00:51:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-12 00:51:39,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:39,338 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:39,338 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1158107046, now seen corresponding path program 1 times [2019-01-12 00:51:39,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:39,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:39,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:39,664 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 00:51:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:51:39,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:51:39,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:51:39,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:39,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:51:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-12 00:51:40,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:51:40,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:51:40,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:51:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:51:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:51:40,118 INFO L87 Difference]: Start difference. First operand 1838 states and 2004 transitions. Second operand 7 states. [2019-01-12 00:51:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:45,392 INFO L93 Difference]: Finished difference Result 3814 states and 4158 transitions. [2019-01-12 00:51:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 00:51:45,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-01-12 00:51:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:45,401 INFO L225 Difference]: With dead ends: 3814 [2019-01-12 00:51:45,401 INFO L226 Difference]: Without dead ends: 1978 [2019-01-12 00:51:45,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:51:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-01-12 00:51:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1707. [2019-01-12 00:51:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:51:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1827 transitions. [2019-01-12 00:51:45,442 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1827 transitions. Word has length 244 [2019-01-12 00:51:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:45,442 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1827 transitions. [2019-01-12 00:51:45,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:51:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1827 transitions. [2019-01-12 00:51:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-12 00:51:45,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:45,451 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:51:45,453 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -31285532, now seen corresponding path program 1 times [2019-01-12 00:51:45,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 00:51:45,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:45,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:51:45,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:45,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:45,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:45,699 INFO L87 Difference]: Start difference. First operand 1707 states and 1827 transitions. Second operand 4 states. [2019-01-12 00:51:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:46,777 INFO L93 Difference]: Finished difference Result 3412 states and 3668 transitions. [2019-01-12 00:51:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:51:46,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2019-01-12 00:51:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:46,785 INFO L225 Difference]: With dead ends: 3412 [2019-01-12 00:51:46,785 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:51:46,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:51:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-01-12 00:51:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:51:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1815 transitions. [2019-01-12 00:51:46,818 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1815 transitions. Word has length 295 [2019-01-12 00:51:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:46,819 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1815 transitions. [2019-01-12 00:51:46,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1815 transitions. [2019-01-12 00:51:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-01-12 00:51:46,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:51:46,825 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:51:46,825 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:51:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:51:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1965255341, now seen corresponding path program 1 times [2019-01-12 00:51:46,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:51:46,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:51:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:51:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:51:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:51:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-01-12 00:51:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:51:47,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:51:47,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:51:47,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:51:47,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:47,393 INFO L87 Difference]: Start difference. First operand 1707 states and 1815 transitions. Second operand 4 states. [2019-01-12 00:51:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:51:48,181 INFO L93 Difference]: Finished difference Result 1707 states and 1815 transitions. [2019-01-12 00:51:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:51:48,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-01-12 00:51:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:51:48,183 INFO L225 Difference]: With dead ends: 1707 [2019-01-12 00:51:48,183 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:51:48,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:51:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:51:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:51:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:51:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:51:48,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2019-01-12 00:51:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:51:48,186 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:51:48,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:51:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:51:48,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:51:48,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:51:48,712 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-01-12 00:51:48,914 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:51:48,918 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:51:48,919 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:51:48,920 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,921 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:51:48,922 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~a17~0 1)) (.cse3 (= ~a16~0 5)) (.cse4 (= ~a7~0 1)) (.cse0 (= ~a16~0 4)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a16~0 6)) (.cse2 (<= ~a7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 (and (not .cse5) .cse6 .cse1)) (and .cse6 .cse1 (= ~a20~0 1) .cse2) (and .cse4 (<= ~a21~0 0)) (and .cse4 .cse1 .cse3) (and .cse4 .cse0 .cse1) (and (= ~a8~0 15) .cse1 .cse5 .cse2))) [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:51:48,923 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:51:48,924 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:51:48,925 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,926 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:51:48,927 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse3 (= ~a16~0 5)) (.cse5 (= ~a7~0 1)) (.cse0 (= ~a16~0 4)) (.cse1 (= ~a21~0 1)) (.cse6 (= ~a16~0 6)) (.cse2 (<= ~a7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse1 (= ~a20~0 1) .cse2) (and .cse5 (<= ~a21~0 0)) (and .cse5 .cse4 (and (not .cse6) .cse1)) (and .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse1) (and (= ~a8~0 15) .cse1 .cse6 .cse2))) [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:51:48,928 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,929 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:51:48,930 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:51:48,931 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,932 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:51:48,933 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,934 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:51:48,935 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:51:48,936 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:51:48,936 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:51:48,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:51:48 BoogieIcfgContainer [2019-01-12 00:51:48,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:51:48,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:51:48,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:51:48,955 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:51:48,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:51:26" (3/4) ... [2019-01-12 00:51:48,966 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:51:49,001 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:51:49,002 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:51:49,179 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:51:49,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:51:49,182 INFO L168 Benchmark]: Toolchain (without parser) took 26785.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,183 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:51:49,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.01 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 251.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 915.1 MB in the beginning and 1.2 GB in the end (delta: -236.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,184 INFO L168 Benchmark]: Boogie Preprocessor took 103.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,185 INFO L168 Benchmark]: RCFGBuilder took 3227.80 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,185 INFO L168 Benchmark]: TraceAbstraction took 22356.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -112.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,186 INFO L168 Benchmark]: Witness Printer took 225.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:51:49,189 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.01 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 251.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 915.1 MB in the beginning and 1.2 GB in the end (delta: -236.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3227.80 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: 106.0 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22356.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -112.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * Witness Printer took 225.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: ((((((((a16 == 4 && a21 == 1) && a7 <= 0) || ((a21 == 1 && a7 <= 0) && a16 == 5)) || (a7 == 1 && (!(a16 == 6) && a17 == 1) && a21 == 1)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a7 <= 0)) || (a7 == 1 && a21 <= 0)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a8 == 15 && a21 == 1) && a16 == 6) && a7 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a16 == 4 && a21 == 1) && a7 <= 0) || ((a21 == 1 && a7 <= 0) && a16 == 5)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a7 <= 0)) || (a7 == 1 && a21 <= 0)) || ((a7 == 1 && a17 == 1) && !(a16 == 6) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a16 == 5)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || (((a8 == 15 && a21 == 1) && a16 == 6) && a7 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 22.2s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 623 SDtfs, 2422 SDslu, 121 SDs, 0 SdLazy, 6164 SolverSat, 766 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1193 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 179 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2146 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2478 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058523 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2169/2196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...