./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer --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 c830b0c5c33990192c3ba87f57f72df9f3b5a041 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:53:13,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:53:13,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:53:13,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:53:13,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:53:13,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:53:13,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:53:13,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:53:13,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:53:13,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:53:13,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:53:13,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:53:13,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:53:13,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:53:13,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:53:13,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:53:13,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:53:13,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:53:13,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:53:13,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:53:13,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:53:13,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:53:13,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:53:13,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:53:13,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:53:13,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:53:13,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:53:13,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:53:13,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:53:13,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:53:13,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:53:13,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:53:13,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:53:13,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:53:13,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:53:13,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:53:13,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:53:13,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:53:13,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:53:13,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:53:13,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:53:13,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:53:13,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:53:13,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:53:13,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:53:13,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:53:13,786 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:53:13,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:53:13,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:53:13,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:53:13,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:53:13,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:53:13,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:53:13,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:53:13,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:53:13,788 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:53:13,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:53:13,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:53:13,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:53:13,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:53:13,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:53:13,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:53:13,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:53:13,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:53:13,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:53:13,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:53:13,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:53:13,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:53:13,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:53:13,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:53:13,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer 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 -> c830b0c5c33990192c3ba87f57f72df9f3b5a041 [2019-11-20 05:53:13,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:53:13,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:53:14,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:53:14,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:53:14,004 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:53:14,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-11-20 05:53:14,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/data/fb235021f/9f3c7c1ad99f432da4e331a95fbf05a6/FLAG9aeb164ad [2019-11-20 05:53:14,615 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:53:14,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2019-11-20 05:53:14,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/data/fb235021f/9f3c7c1ad99f432da4e331a95fbf05a6/FLAG9aeb164ad [2019-11-20 05:53:14,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/data/fb235021f/9f3c7c1ad99f432da4e331a95fbf05a6 [2019-11-20 05:53:14,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:53:14,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:53:14,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:53:14,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:53:14,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:53:14,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:14" (1/1) ... [2019-11-20 05:53:14,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a0443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:14, skipping insertion in model container [2019-11-20 05:53:14,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:14" (1/1) ... [2019-11-20 05:53:14,915 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:53:14,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:53:15,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:53:15,524 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:53:15,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:53:15,718 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:53:15,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15 WrapperNode [2019-11-20 05:53:15,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:53:15,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:53:15,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:53:15,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:53:15,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:53:15,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:53:15,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:53:15,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:53:15,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2019-11-20 05:53:15,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:53:15,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:53:15,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:53:15,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:53:15,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:53:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:53:16,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:53:17,310 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:53:17,311 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:53:17,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:17 BoogieIcfgContainer [2019-11-20 05:53:17,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:53:17,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:53:17,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:53:17,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:53:17,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:53:14" (1/3) ... [2019-11-20 05:53:17,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b0edc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:17, skipping insertion in model container [2019-11-20 05:53:17,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (2/3) ... [2019-11-20 05:53:17,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b0edc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:17, skipping insertion in model container [2019-11-20 05:53:17,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:17" (3/3) ... [2019-11-20 05:53:17,319 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2019-11-20 05:53:17,330 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:53:17,341 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:53:17,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:53:17,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:53:17,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:53:17,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:53:17,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:53:17,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:53:17,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:53:17,402 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:53:17,402 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:53:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 05:53:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:53:17,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:17,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:17,450 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 806224438, now seen corresponding path program 1 times [2019-11-20 05:53:17,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:17,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635715586] [2019-11-20 05:53:17,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:17,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635715586] [2019-11-20 05:53:17,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:17,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:17,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465934000] [2019-11-20 05:53:17,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:18,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:18,017 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-20 05:53:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:19,619 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-20 05:53:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:19,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 05:53:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:19,653 INFO L225 Difference]: With dead ends: 662 [2019-11-20 05:53:19,656 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 05:53:19,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 05:53:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-20 05:53:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-20 05:53:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-20 05:53:19,778 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 89 [2019-11-20 05:53:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:19,779 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-20 05:53:19,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-20 05:53:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 05:53:19,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:19,793 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:53:19,794 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1182931709, now seen corresponding path program 1 times [2019-11-20 05:53:19,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:19,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913395768] [2019-11-20 05:53:19,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:19,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913395768] [2019-11-20 05:53:19,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:19,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:19,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516961036] [2019-11-20 05:53:19,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:19,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:53:19,983 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 3 states. [2019-11-20 05:53:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:20,648 INFO L93 Difference]: Finished difference Result 1185 states and 1654 transitions. [2019-11-20 05:53:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:20,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 05:53:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:20,655 INFO L225 Difference]: With dead ends: 1185 [2019-11-20 05:53:20,655 INFO L226 Difference]: Without dead ends: 790 [2019-11-20 05:53:20,657 INFO L630 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-11-20 05:53:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-20 05:53:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-20 05:53:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 05:53:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-20 05:53:20,681 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 96 [2019-11-20 05:53:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:20,682 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-20 05:53:20,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:53:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-20 05:53:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 05:53:20,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:20,685 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:20,685 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2032630224, now seen corresponding path program 1 times [2019-11-20 05:53:20,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:20,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311904720] [2019-11-20 05:53:20,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:53:20,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311904720] [2019-11-20 05:53:20,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:20,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:20,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799311201] [2019-11-20 05:53:20,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:20,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:20,743 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-20 05:53:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:21,527 INFO L93 Difference]: Finished difference Result 1971 states and 2548 transitions. [2019-11-20 05:53:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:21,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 05:53:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:21,538 INFO L225 Difference]: With dead ends: 1971 [2019-11-20 05:53:21,538 INFO L226 Difference]: Without dead ends: 1183 [2019-11-20 05:53:21,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-20 05:53:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2019-11-20 05:53:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-20 05:53:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1485 transitions. [2019-11-20 05:53:21,583 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1485 transitions. Word has length 102 [2019-11-20 05:53:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:21,583 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1485 transitions. [2019-11-20 05:53:21,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2019-11-20 05:53:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 05:53:21,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:21,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:21,603 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1446444757, now seen corresponding path program 1 times [2019-11-20 05:53:21,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:21,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221713943] [2019-11-20 05:53:21,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 05:53:21,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221713943] [2019-11-20 05:53:21,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:21,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:53:21,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850979078] [2019-11-20 05:53:21,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:21,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:53:21,718 INFO L87 Difference]: Start difference. First operand 1183 states and 1485 transitions. Second operand 3 states. [2019-11-20 05:53:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:22,387 INFO L93 Difference]: Finished difference Result 3019 states and 3821 transitions. [2019-11-20 05:53:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:22,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 05:53:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:22,400 INFO L225 Difference]: With dead ends: 3019 [2019-11-20 05:53:22,400 INFO L226 Difference]: Without dead ends: 1707 [2019-11-20 05:53:22,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:53:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-20 05:53:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-20 05:53:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 05:53:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1661 transitions. [2019-11-20 05:53:22,457 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1661 transitions. Word has length 104 [2019-11-20 05:53:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:22,458 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1661 transitions. [2019-11-20 05:53:22,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:53:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1661 transitions. [2019-11-20 05:53:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 05:53:22,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:22,461 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 05:53:22,462 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:22,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1854334615, now seen corresponding path program 1 times [2019-11-20 05:53:22,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:22,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093318338] [2019-11-20 05:53:22,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:53:22,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093318338] [2019-11-20 05:53:22,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:22,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:22,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667986668] [2019-11-20 05:53:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:22,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:22,594 INFO L87 Difference]: Start difference. First operand 1445 states and 1661 transitions. Second operand 4 states. [2019-11-20 05:53:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:23,329 INFO L93 Difference]: Finished difference Result 3024 states and 3467 transitions. [2019-11-20 05:53:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:53:23,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-20 05:53:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:23,340 INFO L225 Difference]: With dead ends: 3024 [2019-11-20 05:53:23,340 INFO L226 Difference]: Without dead ends: 1581 [2019-11-20 05:53:23,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:53:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-11-20 05:53:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1576. [2019-11-20 05:53:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 05:53:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1795 transitions. [2019-11-20 05:53:23,393 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1795 transitions. Word has length 112 [2019-11-20 05:53:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:23,393 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1795 transitions. [2019-11-20 05:53:23,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1795 transitions. [2019-11-20 05:53:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 05:53:23,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:23,397 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 05:53:23,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1664786527, now seen corresponding path program 1 times [2019-11-20 05:53:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424539632] [2019-11-20 05:53:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:23,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424539632] [2019-11-20 05:53:23,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:23,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:53:23,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782336265] [2019-11-20 05:53:23,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:23,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:23,523 INFO L87 Difference]: Start difference. First operand 1576 states and 1795 transitions. Second operand 4 states. [2019-11-20 05:53:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:24,237 INFO L93 Difference]: Finished difference Result 3805 states and 4379 transitions. [2019-11-20 05:53:24,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:24,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 05:53:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:24,252 INFO L225 Difference]: With dead ends: 3805 [2019-11-20 05:53:24,253 INFO L226 Difference]: Without dead ends: 2362 [2019-11-20 05:53:24,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-20 05:53:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-20 05:53:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-20 05:53:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-11-20 05:53:24,335 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 116 [2019-11-20 05:53:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-11-20 05:53:24,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-11-20 05:53:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 05:53:24,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:24,340 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-20 05:53:24,340 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2107396270, now seen corresponding path program 1 times [2019-11-20 05:53:24,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:24,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307994265] [2019-11-20 05:53:24,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:24,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307994265] [2019-11-20 05:53:24,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:24,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 05:53:24,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316999139] [2019-11-20 05:53:24,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:53:24,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:53:24,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:24,549 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 8 states. [2019-11-20 05:53:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:25,400 INFO L93 Difference]: Finished difference Result 3716 states and 4094 transitions. [2019-11-20 05:53:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:53:25,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-20 05:53:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:25,412 INFO L225 Difference]: With dead ends: 3716 [2019-11-20 05:53:25,413 INFO L226 Difference]: Without dead ends: 2142 [2019-11-20 05:53:25,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-20 05:53:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-11-20 05:53:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 05:53:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2009 transitions. [2019-11-20 05:53:25,469 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2009 transitions. Word has length 122 [2019-11-20 05:53:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:25,469 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2009 transitions. [2019-11-20 05:53:25,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:53:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2009 transitions. [2019-11-20 05:53:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 05:53:25,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:25,475 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 05:53:25,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1246749755, now seen corresponding path program 1 times [2019-11-20 05:53:25,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:25,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858586140] [2019-11-20 05:53:25,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:25,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858586140] [2019-11-20 05:53:25,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:25,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:53:25,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734200197] [2019-11-20 05:53:25,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:25,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:25,658 INFO L87 Difference]: Start difference. First operand 1838 states and 2009 transitions. Second operand 4 states. [2019-11-20 05:53:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:26,151 INFO L93 Difference]: Finished difference Result 3805 states and 4174 transitions. [2019-11-20 05:53:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:26,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 05:53:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:26,165 INFO L225 Difference]: With dead ends: 3805 [2019-11-20 05:53:26,165 INFO L226 Difference]: Without dead ends: 2100 [2019-11-20 05:53:26,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-20 05:53:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-20 05:53:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-20 05:53:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2260 transitions. [2019-11-20 05:53:26,222 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2260 transitions. Word has length 148 [2019-11-20 05:53:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:26,223 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2260 transitions. [2019-11-20 05:53:26,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2260 transitions. [2019-11-20 05:53:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 05:53:26,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:26,228 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-20 05:53:26,228 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash 691080292, now seen corresponding path program 1 times [2019-11-20 05:53:26,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:26,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315873309] [2019-11-20 05:53:26,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:26,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315873309] [2019-11-20 05:53:26,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:26,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 05:53:26,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536027389] [2019-11-20 05:53:26,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 05:53:26,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 05:53:26,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:53:26,937 INFO L87 Difference]: Start difference. First operand 2100 states and 2260 transitions. Second operand 13 states. [2019-11-20 05:53:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:28,420 INFO L93 Difference]: Finished difference Result 4515 states and 4867 transitions. [2019-11-20 05:53:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 05:53:28,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-11-20 05:53:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:28,431 INFO L225 Difference]: With dead ends: 4515 [2019-11-20 05:53:28,432 INFO L226 Difference]: Without dead ends: 2400 [2019-11-20 05:53:28,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:53:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-11-20 05:53:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2135. [2019-11-20 05:53:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-11-20 05:53:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2292 transitions. [2019-11-20 05:53:28,488 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2292 transitions. Word has length 161 [2019-11-20 05:53:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:28,488 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2292 transitions. [2019-11-20 05:53:28,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 05:53:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2292 transitions. [2019-11-20 05:53:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 05:53:28,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:28,494 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:28,494 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2108776820, now seen corresponding path program 1 times [2019-11-20 05:53:28,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:28,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739707295] [2019-11-20 05:53:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:28,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739707295] [2019-11-20 05:53:28,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:28,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 05:53:28,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674631138] [2019-11-20 05:53:28,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:53:28,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:28,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:53:28,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:53:28,646 INFO L87 Difference]: Start difference. First operand 2135 states and 2292 transitions. Second operand 6 states. [2019-11-20 05:53:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:29,519 INFO L93 Difference]: Finished difference Result 4152 states and 4463 transitions. [2019-11-20 05:53:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:53:29,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-11-20 05:53:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:29,535 INFO L225 Difference]: With dead ends: 4152 [2019-11-20 05:53:29,535 INFO L226 Difference]: Without dead ends: 2150 [2019-11-20 05:53:29,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:53:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-11-20 05:53:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2135. [2019-11-20 05:53:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-11-20 05:53:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2269 transitions. [2019-11-20 05:53:29,589 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2269 transitions. Word has length 163 [2019-11-20 05:53:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:29,589 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 2269 transitions. [2019-11-20 05:53:29,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:53:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2269 transitions. [2019-11-20 05:53:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 05:53:29,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:29,596 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 05:53:29,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash -263540360, now seen corresponding path program 1 times [2019-11-20 05:53:29,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:29,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530771748] [2019-11-20 05:53:29,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 05:53:29,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530771748] [2019-11-20 05:53:29,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:29,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:53:29,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742001842] [2019-11-20 05:53:29,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:29,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:29,782 INFO L87 Difference]: Start difference. First operand 2135 states and 2269 transitions. Second operand 4 states. [2019-11-20 05:53:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:30,615 INFO L93 Difference]: Finished difference Result 4921 states and 5237 transitions. [2019-11-20 05:53:30,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:30,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-20 05:53:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:30,617 INFO L225 Difference]: With dead ends: 4921 [2019-11-20 05:53:30,617 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:53:30,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:53:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:53:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:53:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:53:30,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-11-20 05:53:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:30,623 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:53:30,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:53:30,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:53:30,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:53:30,755 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 87 [2019-11-20 05:53:31,406 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-11-20 05:53:31,887 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-11-20 05:53:31,890 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 05:53:31,891 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 05:53:31,892 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 05:53:31,893 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 05:53:31,894 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 05:53:31,895 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 05:53:31,896 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 05:53:31,896 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 05:53:31,896 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 05:53:31,896 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 05:53:31,896 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 15 ~a8~0)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (not .cse4)) (.cse9 (= 5 ~a16~0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a8~0 13)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (not .cse7)) (.cse11 (<= ~a17~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4)) (and .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse1 .cse3 .cse7 (not .cse8)) (and .cse5 .cse7 .cse9) (or (and .cse6 .cse2 .cse1 .cse3 .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse6 .cse2 .cse1 .cse3 .cse7)) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse2 .cse1 .cse3 .cse7 (= ~a16~0 5)) (and .cse5 .cse10 .cse11) (and .cse11 .cse9) (and .cse1 .cse11 .cse3 .cse7) (and .cse5 .cse0) (and .cse8 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse10 .cse11)))) [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 05:53:31,897 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 05:53:31,898 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 05:53:31,899 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,900 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 05:53:31,901 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 05:53:31,902 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= 15 ~a8~0)) (.cse4 (= ~a20~0 1))) (let ((.cse6 (not .cse4)) (.cse9 (= 5 ~a16~0)) (.cse5 (= 1 ~a7~0)) (.cse0 (= ~a8~0 13)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (not .cse7)) (.cse11 (<= ~a17~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4)) (and .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse1 .cse3 .cse7 (not .cse8)) (and .cse5 .cse7 .cse9) (or (and .cse6 .cse2 .cse1 .cse3 .cse7 (or (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and (= 2 ULTIMATE.start_calculate_output_~input) .cse6 .cse2 .cse1 .cse3 .cse7)) (and .cse5 .cse10 .cse11) (and .cse11 .cse9) (and .cse2 .cse1 .cse3 .cse7 (= ~a16~0 5)) (and .cse1 .cse11 .cse3 .cse7) (and .cse5 .cse0) (and .cse8 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse10 .cse11)))) [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 05:53:31,903 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,904 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 05:53:31,905 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 05:53:31,906 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 05:53:31,907 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 05:53:31,908 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 05:53:31,909 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,910 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 05:53:31,911 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 05:53:31,912 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 05:53:31,912 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 05:53:31,912 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 05:53:31,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:53:31 BoogieIcfgContainer [2019-11-20 05:53:31,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:53:31,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:53:31,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:53:31,940 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:53:31,940 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:17" (3/4) ... [2019-11-20 05:53:31,944 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:53:31,970 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:53:31,972 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:53:32,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_23758c25-70a9-41ed-a566-01f408ecd853/bin/uautomizer/witness.graphml [2019-11-20 05:53:32,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:53:32,101 INFO L168 Benchmark]: Toolchain (without parser) took 17207.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.6 MB). Free memory was 939.4 MB in the beginning and 1.3 GB in the end (delta: -356.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,102 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:53:32,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:53:32,103 INFO L168 Benchmark]: Boogie Preprocessor took 81.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,103 INFO L168 Benchmark]: RCFGBuilder took 1385.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.4 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,103 INFO L168 Benchmark]: TraceAbstraction took 14626.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 271.1 MB). Free memory was 967.4 MB in the beginning and 1.3 GB in the end (delta: -344.3 MB). Peak memory consumption was 468.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,104 INFO L168 Benchmark]: Witness Printer took 160.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:53:32,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 823.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1385.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 967.4 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14626.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 271.1 MB). Free memory was 967.4 MB in the beginning and 1.3 GB in the end (delta: -344.3 MB). Peak memory consumption was 468.7 MB. Max. memory is 11.5 GB. * Witness Printer took 160.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: ((((((((((((a8 == 13 && a12 == 8) && (a17 == 1 && a21 == 1) && a20 == 1) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || ((1 == a7 && 15 == a8) && 5 == a16)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input)) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((((!(1 == input) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (a17 <= 0 && 5 == a16)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8)) || (1 == a7 && a8 == 13)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((a8 == 13 && a12 == 8) && (a17 == 1 && a21 == 1) && a20 == 1) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || ((1 == a7 && 15 == a8) && 5 == a16)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && ((3 == input || 6 == input) || 5 == input)) || (((((2 == input && !(a20 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (a17 <= 0 && 5 == a16)) || ((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8)) || (1 == a7 && a8 == 13)) || (((((a16 == 4 && !(15 == a8)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 14.5s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 845 SDtfs, 3285 SDslu, 143 SDs, 0 SdLazy, 6607 SolverSat, 895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2135occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 389 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5657 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 693 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 931189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 627/627 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...